Semiconductor device and semiconductor signal processing apparatus

ABSTRACT

A memory cell mat is divided into a plurality of entries, and an arithmetic logic unit is arranged corresponding to each entry. Between the entries and the corresponding arithmetic logic units, arithmetic/logic operation is executed in bit-serial and entry-parallel manner. Where parallel operation is not very effective, data is transferred in entry-serial and bit-parallel manner to a group of processors provided at a lower portion of the memory mat. In this manner, a large amount of data can be processed at high speed regardless of the contents of operation or data bit width.

RELATED APPLICATIONS

This application is a Divisional of U.S. application Ser. No.11/148,369, filed Jun. 9, 2005, claiming priority of JapaneseApplication Nos. 2004-171658, filed Jun. 9, 2004; 2004-175193, filedJun. 14, 2004; 2004-282449, filed Sep. 28, 2004; and 2005-143109, filedMay 16, 2005, the entire contents of each of which are herebyincorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a semiconductor device and, morespecifically, to a configuration of a processing circuit using asemiconductor memory performing arithmetic/logic operation on a largeamount of data at high speed.

2. Description of the Background Art

Recently, along with wide spread use of portable terminal devices,digital signal processing allowing high speed processing of a largeamount of data including voice and image comes to have higherimportance. For such digital signal processing, generally, a DSP(Digital Signal Processor) is used as a dedicated semiconductor device.Digital signal processing of audio and image includes data processingsuch as filtering, which frequently requires arithmetic operations withrepetitive product and sum operations. Therefore, a DSP is generallyconfigured to contain a multiplication circuit, an adder circuit and aregister for accumulation. When such a dedicated DSP is used, theproduct and sum operation can be executed in one machine cycle, enablinga high-speed arithmetic/logic operation.

Prior art Reference 1 (Japanese Patent Laying-Open No. 06-324862) showsan arrangement that uses a register file to perform such asum-of-products operation. According to Reference 1, two terms ofoperand data stored in the register file are read, added by a processor,and again written to the register file through a write data register. Inthe arrangement shown in Reference 1, a write address and a read addressare simultaneously given to the register file to execute data writingand data reading simultaneously, and therefore, time of processing canbe made shorter than an arrangement having a data write cycle and a dataread cycle provided separately for an arithmetic/logic operation.

Prior art Reference 2 (Japanese Patent Laying-Open No. 05-197550) showsan arrangement aimed at high speed processing of a large amount of data.In this arrangement shown in FIG. 2, a plurality of processors arearranged in parallel, with each processor containing a memory. Toachieve high speed parallel operations, each processor individuallygenerates a memory address.

Further, prior art Reference 3 (Japanese Patent Laying-Open No.10-074141) shows a signal processing apparatus aimed at high speedprocessing such as DCT (Discrete Cosine Transform) of image data. In thearrangement shown in Reference 3, image data are input in a bit-paralleland word-serial sequence, that is, by the word (pixel data) unit, andtherefore, the data are converted to word-parallel and bit-serial databy a serial/parallel converter circuit and written to a memory array.Then, the data are transferred to processors (ALUs) arrangedcorresponding to the memory array, and parallel operations are executed.The memory array is divided into blocks corresponding to image datablocks, and in each block, pixel data forming the corresponding imageblock are stored word by word in each row.

In the arrangement shown in Reference 3, data are transferred on theword by word (data corresponding to one pixel) basis between the memoryblock and the corresponding processor. To achieve high speed filteringsuch as DCT, the same process is performed on the transferred word inthe corresponding processor in each block. The results ofarithmetic/logic operations are again written to the memory array,subjected to parallel/serial conversion so that the bit-serial andword-parallel data are converted to bit-parallel and word-serial data,and the resulting data are output successively line by line. In ageneral processing, bit positions of data are not converted, and generalarithmetic/logic operations are executed on a plurality of data inparallel by the processors.

Prior art Reference 4 (Japanese Patent Laying-Open No. 2003-114797)shows a data processing apparatus aimed at executing a plurality ofdifferent arithmetic/logic operations in parallel. According toReference 4, a plurality of logic modules each having limited functionsare connected to multi-port type data memories. As to the connectionbetween the logic modules and the multi-port data memories, the portsand memories of the multi-port memories to be connected to the logicmodules are limited. Therefore, an address area available for datareading and writing by each logic module accessing the multi-port datamemory is limited. The result of operation by each logic module iswritten to a data memory to which access is allowed, and through themulti-port data memories, data are successively transferred through thelogic modules, to achieve data processing in a pipe-line manner.

When the amount of data to be processed is very large, even a dedicatedDSP is insufficient to attain dramatic improvement in performance. Byway of example, when the data to be operated includes 10,000 sets and anoperation of each data can be executed in one machine cycle, at least10,000 cycles are necessary to finish the operation. Therefore, thougheach process can be done at high speed in an arrangement that performsthe sum-of-products operation using a register file such as described inReference 1, when the amount of data increases, the time of processingincreases in proportion thereto as the data are processed in series, andtherefore, such an arrangement cannot achieve high speed processing.

When such a dedicated DSP is used, the processing performance greatlydepends on operating frequency, and therefore, if high speed processingwere given priority, power consumption would considerably be increased.

Use of a register file and processors as described in Reference 1 isoften designed for a specific application, so that the operation bitwidth and configuration of processing circuit tend to be fixed. When thearrangement is to be diverted to another application, the bit width,configuration of processing circuit and others be re-designed, andhence, it lacks flexibility for different applications ofarithmetic/logic operations.

In the arrangement described in Reference 2, each processor contains amemory, and each processor accesses a different memory address area forprocessing. The data memory and the processor are arranged in separateareas, and in a logic module, address transfer and data access must beperformed between the processor and the memory. This means that datatransfer takes time, machine cycle cannot be made shorter and hence,high speed processing is hindered.

The arrangement described in Reference 3 is to increase speed ofprocessing such as DCT of image data, and in this arrangement, pixeldata of one line of an image plane are stored in one row of memorycells, and image blocks aligned along the row direction are subjected toparallel processing. Therefore, when the number of pixels per lineincreases to achieve very fine images, the memory array arrangementwould be of a formidable size. Assume that data of one pixel consists of8 bits and one line has 512 pixels, the number of memory cells of onerow in the memory array will be 8×512=4 k bits, resulting in verysignificant load on a row selecting line (word line) to which one row ofmemory cells are connected. Thus, it becomes impossible to select, athigh speed, a memory cell to transfer data between the operating portionand the memory cell, hindering high speed processing.

Though Reference 3 shows an arrangement in which the memory cell arraysare positioned on opposite sides of a group of processing circuits,specific configuration of the memory array is not shown. Further, thoughthe reference shows an arrangement of processors in an array, specificarrangement of the group of processors is not shown at all.

The arrangement described in Reference 4 is provided with a plurality ofmulti-port data memories and a plurality of processors (ALUs) of lowfunction that can access only limited areas of the respective multi-portmemories. The processors (ALUs) and the memories, however, are arrangedon different areas. Therefore, because of line capacitance and the like,high speed data transfer is difficult, and even when pipeline processingis performed, the machine cycle of the pipeline cannot be made shorter.

References 1 to 4 do not consider at all how to accommodate data as theobject of arithmetic/logic operation having different wordconfigurations.

In an arrangement in which a number of processors are arranged and dataare transferred among the group of processors to achieve paralleloperations, it is possible to flexibly accommodate for the change inprocessing contents by switching a data transfer path. As regards such aswitching of data transfer path, a cross bar switch is used for lineexchange in the field of communication or a router in a parallelcomputer. Prior art Reference 5 (Japanese Patent Laying-Open No.10-254843) discloses an exemplary configuration of the cross bar switch.

In the cross bar switch configuration according to Reference 5, switchesare arranged along paths that allow connection of functional blocks, andin accordance with path designating information, the switches areselectively made conductive to set a data transfer path. When such aswitch matrix is used, however, as the number of processors (functionalblocks) to be connected increases, possible number of connectable pathsincreases, the layout area of switch circuits increases and in addition,the arrangement of switch control signal lines becomes complicated.

SUMMARY OF THE INVENTION

An object of the present invention is to provide a semiconductor devicecapable of processing a large amount of data at high speed.

Another object of the present invention is to provide a semiconductordevice capable of executing an arithmetic/logic operation at high speed,regardless of word configuration of data or contents of arithmetic/logicoperation.

A still further object of the present invention is to provide asemiconductor device having arithmetic/logic operation function allowingflexible change in contents of processing.

A further object is to provide a cross bar switch that can setconnection path among a group of processors with a small area ofoccupation.

The present invention provides a semiconductor device, including: amemory cell array having a plurality of memory cells arranged in amatrix of rows and columns and divided into a plurality of entries; aplurality of first processing circuits arranged corresponding to theentries respectively, each performing a designated arithmetic/logicoperation on data of the corresponding entry; a plurality of datatransfer lines transferring data between each of the entries and thecorresponding one of the first processing circuits; and a plurality ofdata transfer circuits arranged corresponding to the plurality of datatransfer lines respectively, transferring data on a bit-by-bit basis inentry-parallel manner to and from the corresponding data transfer lines.

Each of the entries stores multi-bit data, and each of the firstprocessing circuits executes an arithmetic/logic operation in bit-serialmanner on the multi-bit data of the corresponding entry.

The semiconductor processing device according to the present inventionfurther includes: a memory cell array divided into a plurality ofentries; a plurality of processing circuits arranged corresponding torespective entries; and a control circuit controlling arithmetic/logicoperation by the processing circuits. The processing circuits eachincludes a processor, first and second registers, and a mask register.The control circuit controls such that an operand bit from acorresponding entry is stored in the first register, an arithmetic/logicoperation is performed on the operand bit of the first register and asecond operand bit from the memory array, the result of thearithmetic/logic operation is stored in the first register, and thevalue stored in the first register is stored in the correspondingposition of the memory cell array.

According to a second aspect, the present invention provides asemiconductor signal processing device, including a memory cell matdivided into a plurality of entries and a plurality of processingcircuits arranged corresponding to the respective entries. Theprocessing circuit includes a Booth register circuit storing a result ofdecoding a set of data bits from a first area of the corresponding entryin accordance with second order Booth's algorithm, a processor receivingdata bits from corresponding positions of the second and third areas ofthe corresponding entry and performing an arithmetic/logic operation onthe received data in accordance with the data stored in the Boothregister, and a result register storing an output data of the processor.

The semiconductor signal processing apparatus in accordance with thesecond aspect of the present invention further includes a controlcircuit for transferring data of the first, second and third areas fromeach entry of the memory cell mat, to the corresponding processingcircuit, transferring and writing the output data of the processor tothe third area of the corresponding entry, and controlling thearithmetic/logic operation of the processing circuit.

According to a third aspect, the present invention provides asemiconductor signal processing device including a memory cell matdivided into a plurality of entries, a plurality of processing circuitsarranged corresponding to the entries, and an operation control signalline provided corresponding to each prescribed number of the pluralityof processing circuits, transmitting an operation control signal to thecorresponding processing circuits.

According to a fourth aspect, the present invention provides asemiconductor signal processing device including a plurality of basicoperation blocks each including a memory cell mat divided into aplurality of entries and a plurality of processing circuits arrangedcorresponding to the respective entries and being capable of executingarithmetic operations independently from others; an internal data busarranged commonly to the basic operation blocks; a large capacity memorycoupled to the internal data bus; and a control circuit for performingdata transfer on the basis of data of one row of the large capacitymemory, between the large capacity memory and a selected basic operationblock.

According to a fifth aspect, the present invention provides asemiconductor signal processing device including: a plurality ofoperation blocks each including a memory cell mat divided into aplurality of entries and processing circuits arranged corresponding tothe respective entries; a neighboring block connecting businterconnecting corresponding entries of neighboring operation blocks;and a bit transfer circuit for interconnecting the processors in theoperation block.

According to a sixth aspect, the present invention provides asemiconductor signal processing device including a plurality ofoperation circuit blocks including a memory cell mat divided into aplurality of entries and processors arranged corresponding to respectiveentries; a global data bus arranged common to the plurality of operationcircuit blocks; a system data bus coupled to an external processingdevice; an orthogonal transformation circuit arranged between the systembus and a first internal transfer bus, changing the configuration ofdata transferred over these buses; a cross bar switch connected betweenthe first internal data transfer bus and a second internal data transferbus and changing a connection path of the first and second internal datatransfer buses; and a selecting circuit connected between the secondinternal transfer bus and the global data bus and selectively connectingthese buses.

The present invention further provides a cross bar switch, providedbetween a plurality of first functional blocks arranged in a line and aplurality of second functional blocks arranged opposing to the pluralityof first functional blocks respectively, for connecting the plurality offirst functional blocks and the plurality of second functional blocks inone-to-one relationship and a given combination, including: a first datasignal line provided corresponding to each of the first functionalblocks, connected to a data signal terminal of the corresponding firstfunctional block, and extending in the same direction as direction ofarrangement of the plurality of first functional blocks; and a selectingcircuit provided corresponding to each first data signal line, selectingany second functional block among the plurality of second functionalblocks in accordance with a select signal from the corresponding firstfunctional block, and connecting a data signal terminal of the selectedsecond functional block to the corresponding first data signal line.

The memory cell array is divided into a plurality of entries, and foreach entry, the first processing circuit is arranged, so thatarithmetic/logic operations on data of a plurality of entries can beperformed in parallel, and high speed processing becomes possible.

Further, data transfer between the first processing circuit and the datatransfer line is executed bit by bit, and arithmetic/logic operation isperformed in bit-serial manner in the first processing circuit, andtherefore, designated arithmetic/logic operation can be executed onmulti-bit data of the corresponding entry, regardless of the wordconfiguration of the data to be processed. Specifically, by anarrangement in which each entry stores a significant data word and eachof the first processors performs arithmetic/logic operation in thebit-serial manner, even when the data word configuration (bit width) ischanged, it becomes possible to perform arithmetic/logic operationcorrespondingly without much changing the hardware, and hence, itbecomes possible to flexibly adapt to various applications.

As the processor and a register are arranged in the processing circuit,it becomes possible to execute various arithmetic/logic operations inthe bit-serial manner, by storing the data as the object ofarithmetic/logic operation in the register.

Further, by providing a plurality of register circuits in the processingcircuit, multiplication in accordance with second-order Booth'salgorithm becomes possible, even when multiplication is performed in thebit-serial manner.

Further, by transmitting a control signal commonly to every prescribednumber of operation blocks among the operation blocks, anarithmetic/logic operation required by the unit of a prescribed numberof operation blocks can be executed. Consequently, operation controlbecomes easier than in an arrangement in which each of the operationblocks is controlled individually, and a plurality of data can beprocessed easily by a single instruction.

Further, by providing a memory of large capacity commonly for aplurality of operation blocks, band width for data transfer between thelarge capacity memory and the operation blocks can be enlarged, andtherefore, data transfer does not pose a bottle neck to thearithmetic/logic operation in each of the operation blocks.

Further, because of an arrangement allowing data transfer amongoperation blocks and processors, arithmetic/logic operation betweenneighboring pixels and the like can be executed easily.

As a data conversion circuit is arranged at the input/output interfaceportion, a word-serial and bit-parallel data string and a bit-serial andword-parallel data string can be converted easily to each other, andtherefore, it becomes possible to perform data processing in bit-serialmanner in a processor and word-by-word outside the processor.

In the cross bar switch in accordance with the present invention, afirst data signal line is provided corresponding to each of the firstfunctional blocks, and the first data signal line is connected to asecond functional block designated by a select signal. Therefore, thearrangement can be simplified, and only a small layout area isnecessary.

The foregoing and other objects, features, aspects and advantages of thepresent invention will become more apparent from the following detaileddescription of the present invention when taken in conjunction with theaccompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 schematically shows an overall configuration of a semiconductordevice in accordance with the present invention.

FIG. 2 schematically shows a configuration of a main processingcircuitry shown in FIG. 1.

FIG. 3 shows an exemplary structure of a memory cell shown in FIG. 2.

FIG. 4 schematically shows an arithmetic/logic operation sequence of asemiconductor device in accordance with Embodiment 1 of the presentinvention.

FIG. 5 shows internal timings in an arithmetic/logic operation of thesemiconductor device in accordance with Embodiment 1 of the presentinvention.

FIG. 6 more specifically shows the configuration of a main portion ofthe semiconductor device in accordance with Embodiment 1 of the presentinvention.

FIG. 7 schematically shows a configuration of an ALU included in thegroup of ALUs shown in FIG. 6.

FIG. 8 shows internal timings in an arithmetic/logic operation of a mainprocessing circuitry of the semiconductor device in accordance withEmbodiment 1 of the present invention.

FIG. 9 schematically shows a pointer designating an address area of thesemiconductor processing device in accordance with Embodiment 1 of thepresent invention.

FIG. 10 shows an exemplary structure of a memory cell used in asemiconductor processing device in accordance with Embodiment 2 of thepresent invention.

FIG. 11 shows internal timings in an arithmetic/logic operation of thesemiconductor processing device in accordance with Embodiment 2 of thepresent invention.

FIG. 12 more specifically shows a configuration of main processingcircuitry of the semiconductor processing device in accordance withEmbodiment 2 of the present invention.

FIG. 13 schematically shows a configuration of a main processingcircuitry of a semiconductor processing device in accordance withEmbodiment 3 of the present invention.

FIG. 14 shows internal timings in an arithmetic/logic operation of amain processing circuitry shown in FIG. 13.

FIG. 15 more specifically shows a configuration of the main processingcircuitry in accordance with Embodiment 3 of the present invention.

FIG. 16 schematically shows a configuration of the main processingcircuitry in accordance with Embodiment 4 of the present invention.

FIG. 17 shows an exemplary configuration of a memory cell shown in FIG.16.

FIG. 18 schematically shows distribution of data as the object ofarithmetic/logic operation in a memory mat in accordance with Embodiment5 of the present invention.

FIG. 19 schematically shows distribution of data as the object ofarithmetic/logic operation in a memory mat of a semiconductor processingdevice in accordance with Embodiment 5 of the present invention.

FIG. 20 schematically shows a configuration of a main portion of themain processing circuitry of the semiconductor processing device inaccordance with Embodiment 5 of the present invention.

FIG. 21 more specifically shows the configuration of the main processingcircuitry in accordance with Embodiment 5 of the present invention.

FIG. 22 schematically shows a configuration of a main portion of mainprocessing circuitry in accordance with Embodiment 6 of the presentinvention.

FIG. 23 schematically shows a configuration of a main portion of mainprocessing circuitry in accordance with Embodiment 7 of the presentinvention.

FIG. 24 schematically shows a configuration of a main portion of mainprocessing circuitry in accordance with Embodiment 8 of the presentinvention.

FIG. 25 schematically shows an example of variable configuration of theALU shown in FIG. 24.

FIG. 26 shows an exemplary configuration of a processing system inaccordance with Embodiment 9 of the present invention.

FIG. 27 schematically shows an exemplary configuration of a processingsystem in accordance with Embodiment 9 of the present invention.

FIG. 28 schematically shows an exemplary configuration of an ALUincluded in a main processing circuitry in a semiconductor processingdevice in accordance with Embodiment 9 of the present invention.

FIG. 29 shows an exemplary configuration of a processing systemutilizing the semiconductor processing device in accordance withEmbodiment 9 of the present invention.

FIG. 30 schematically shows a configuration of a main portion of a mainprocessing circuitry in accordance with Embodiment 10 of the presentinvention.

FIG. 31 schematically shows a configuration of a redundancy repairingcircuit for a word line shown in FIG. 30.

FIG. 32 schematically shows a configuration of a redundancy repairingcircuit for a bit line shown in FIG. 30.

FIG. 33 schematically shows a configuration of a main portion of a basicoperation block in accordance with Embodiment 11 of the presentinvention.

FIG. 34 schematically shows a configuration of a unit ALU circuit blockshown in FIG. 33.

FIG. 35 shows, in the form of a list, register instructions inaccordance with Embodiment 11 of the present invention.

FIG. 36 shows, in the form of a list, ALU instructions in accordancewith Embodiment 11 of the present invention.

FIG. 37 shows, in the form of a list, ALU load/store instructions inaccordance with Embodiment 11 of the present invention.

FIG. 38 shows, in the form of a list, instructions for moving databetween entries in accordance with Embodiment 11 of the presentinvention.

FIG. 39 shows, in the form of a list, ALU arithmetic/logic operationinstructions in accordance with Embodiment 11 of the present invention.

FIG. 40 shows, in the form of a list, ALU logic operation instructionsin accordance with Embodiment 11 of the present invention.

FIG. 41 shows an exemplary program in accordance with Embodiment 11 ofthe present invention.

FIG. 42 schematically shows a data flow of an addition program of FIG.41.

FIG. 43 shows a subtraction program in accordance with Embodiment 11 ofthe present invention.

FIG. 44 shows a multiplication program in accordance with Embodiment 11of the present invention.

FIG. 45 schematically shows a data flow of the multiplication programshown in FIG. 44.

FIG. 46 shows entry address allocation at the time of division inaccordance with Embodiment 11 of the present invention.

FIG. 47 shows a division program in accordance with Embodiment 11 of thepresent invention.

FIGS. 48A to 48F schematically show a data flow of the division programshown in FIG. 47.

FIG. 49 schematically shows a configuration of a unit ALU circuit blockin accordance with Embodiment 12 of the present invention.

FIG. 50 shows, in the form of a list, procedures for generating apartial product in accordance with second order Booth's algorithm.

FIG. 51 schematically shows the process for generating a partial productin accordance with second order Booth's algorithm.

FIG. 52 shows an example of multiplication in accordance with secondorder Booth's algorithm.

FIG. 53 shows, in the form of a list, register instructions inaccordance with Embodiment 12 of the present invention.

FIG. 54 shows, in the form of a list, ALU instructions in accordancewith Embodiment 12 of the present invention.

FIG. 55 shows, in the form of a list, ALU set/clear instructions inaccordance with Embodiment 12 of the present invention.

FIG. 56 shows, in the form of a list, ALU load/store instructions inaccordance with Embodiment 12 of the present invention.

FIG. 57 shows, in the form of a list, instructions for moving databetween entries in accordance with Embodiment 12 of the presentinvention.

FIG. 58 shows, in the form of a list, ALU arithmetic operationinstructions in accordance with Embodiment 12 of the present invention.

FIG. 59 shows, in the form of a list, ALU arithmetic operationinstructions in accordance with Embodiment 12 of the present invention.

FIG. 60 shows, in the form of a list, values stored in the register andcorresponding data processing in accordance with Embodiment 12 of thepresent invention.

FIG. 61 shows, in the form of a list, ALU logic operation instructionsin accordance with Embodiment 12 of the present invention.

FIG. 62 shows a signed multiplication program in accordance withEmbodiment 12 of the present invention.

FIG. 63 shows an entry address pointer at the time of multiplication inaccordance with Embodiment 12 of the present invention.

FIG. 64 schematically shows a flow of data bits at the time ofmultiplication in accordance with Embodiment 12 of the presentinvention.

FIG. 65 schematically shows a multiplication process in accordance withEmbodiment 12 of the present invention.

FIG. 66A shows an entry pointer in addition operation in accordance withEmbodiment 12 of the present invention.

FIG. 66B shows an addition program.

FIG. 67A shows an entry pointer in subtraction operation in accordancewith Embodiment 12 of the present invention.

FIG. 67B shows a subtraction program.

FIG. 68 shows an unsigned multiplication program in accordance withEmbodiment 12 of the present invention.

FIG. 69 shows a division program in accordance with Embodiment 12 of thepresent invention.

FIG. 70 schematically shows a configuration of a unit ALU circuit inaccordance with Embodiment 13 of the present invention.

FIG. 71 shows, in the form of a list, pointer register instructions inaccordance with Embodiment 13 of the present invention.

FIG. 72 shows, in the form of a list, instructions for 1-bit operationof the ALU in accordance with Embodiment 13 of the present invention.

FIG. 73 shows, in the form of a list, ALU load/store instructions for2-bit operation in accordance with Embodiment 13 of the presentinvention.

FIG. 74 shows, in the form of a list, instructions for moving databetween entries for 1-bit operation in accordance with Embodiment 13 ofthe present invention.

FIG. 75 shows, in the form of a list, instructions for moving databetween entries for 2-bit operation in accordance with Embodiment 13 ofthe present invention.

FIG. 76 shows, in the form of a list, ALU arithmetic operationinstructions for 1-bit operation in accordance with Embodiment 13 of thepresent invention.

FIG. 77 shows, in the form of a list, ALU arithmetic operationinstructions for 2-bit operation in accordance with Embodiment 13 of thepresent invention.

FIG. 78 shows, in the form of a list, register bit values andcorresponding data processing in accordance with Embodiment 13 of thepresent invention.

FIG. 79 shows a multiplication program in accordance with Embodiment 13of the present invention.

FIG. 80 schematically shows connection of a unit ALU circuit inaccordance with Embodiment 13 of the present invention.

FIG. 81 schematically shows a data flow when the multiplication programis executed in accordance with Embodiment 13 of the present invention.

FIG. 82 schematically shows a data flow when multiplication is done inaccordance with Embodiment 13 of the present invention.

FIG. 83 schematically shows a connection of a unit ALU circuit for 1-bitarithmetic/logic operation in accordance with Embodiment 13 of thepresent invention.

FIG. 84 shows an addition program in accordance with Embodiment 13 ofthe present invention.

FIG. 85 shows a subtraction program in accordance with Embodiment 13 ofthe present invention.

FIG. 86 shows an unsigned multiplication program in accordance withEmbodiment 13 of the present invention.

FIG. 87 shows a division program in accordance with Embodiment 13 of thepresent invention.

FIG. 88 schematically shows a path for writing data to an entry inaccordance with Embodiment 13 of the present invention.

FIG. 89 schematically shows a configuration of ALU control in accordancewith Embodiment 14 of the present invention.

FIG. 90 schematically shows a configuration of ALU control in accordancewith Embodiment 15 of the present invention.

FIG. 91 schematically shows a configuration of a semiconductorprocessing device in accordance with Embodiment 16 of the presentinvention.

FIG. 92 schematically shows a data transfer path among memories inaccordance with Embodiment 16 of the present invention.

FIG. 93 schematically shows a configuration for controlling datatransfer in accordance with Embodiment 16 of the present invention.

FIG. 94 schematically shows a data transfer path between a largecapacity memory and main processing circuitry in accordance withEmbodiment 16 of the present invention.

FIG. 95 schematically shows a configuration of a semiconductorprocessing device in accordance with Embodiment 17 of the presentinvention.

FIG. 96 schematically shows a memory configuration in accordance withEmbodiment 17 of the present invention.

FIG. 97 schematically shows a configuration of a large capacity memoryin accordance with Embodiment 17 of the present invention.

FIG. 98 shows a data transfer operation in the memory configurationshown in FIG. 97.

FIG. 99 schematically shows connection among ALUs in accordance withEmbodiment 18 of the present invention.

FIG. 100 schematically shows a configuration of a portion related to onebus line of buses connecting neighboring blocks shown in FIG. 99.

FIG. 101 schematically shows a configuration of a first modification ofEmbodiment 18 of the present invention.

FIG. 102 schematically shows a configuration of a second modification ofEmbodiment 18 of the present invention.

FIG. 103 schematically shows a configuration of a switch circuit forinterconnection among ALUs in accordance with Embodiment 19 of thepresent invention.

FIG. 104 schematically shows a structure of the switch circuit forinterconnecting ALUs shown in FIG. 103.

FIG. 105 schematically shows a configuration of a first modification ofEmbodiment 19 of the present invention.

FIG. 106 schematically shows an exemplary structure of a programmableswitch circuit shown in FIG. 105.

FIG. 107 shows a first state of connection of the programmable switchcircuit shown in FIG. 106.

FIG. 108 shows a second state of connection of the programmable switchcircuit shown in FIG. 106.

FIG. 109 shows a third state of connection of the programmable switchcircuit shown in FIG. 106.

FIG. 110 shows an exemplary connection of a switch circuit forconnecting ALUs in accordance with a first modification of Embodiment 19of the present invention.

FIG. 111 shows another exemplary connection of a programmable switch inaccordance with the first modification of Embodiment 19 of the presentinvention.

FIG. 112 schematically shows an arrangement of ALUs in accordance with asecond modification of Embodiment 19 of the present invention.

FIG. 113 schematically shows interconnections of a switch circuit forconnecting ALUs in the ALU arrangement of FIG. 112.

FIG. 114 schematically shows an example of data bus connection betweenneighboring blocks shown in FIG. 113.

FIG. 115 schematically shows an arrangement of a third modification ofEmbodiment 19 of the present invention.

FIG. 116 schematically shows an arrangement of a fourth modification ofEmbodiment 19 of the present invention.

FIG. 117 schematically shows a configuration of a programmable switch inaccordance with a fifth modification of Embodiment 19 of the presentinvention.

FIG. 118 schematically shows an exemplary configuration of atransmission/reception data register shown in FIG. 117.

FIG. 119 schematically shows a configuration of a bus connecting ALUs inaccordance with a sixth modification of Embodiment 19 of the presentinvention.

FIG. 120 schematically shows a configuration of an input/output circuitin accordance with Embodiment 20 of the present invention.

FIG. 121 schematically shows a configuration of a data output portion ofan orthogonal transformation circuit shown in FIG. 120.

FIG. 122 schematically represents a data transformation operation by theorthogonal transformation circuit shown in FIG. 121.

FIG. 123 schematically shows a structure of transforming element shownin FIG. 121.

FIG. 124 schematically shows a configuration of a data input portion ofthe orthogonal transformation circuit shown in FIG. 120.

FIG. 125 schematically shows a data transforming operation by the datainput portion of the orthogonal transformation circuit shown in FIG.124.

FIG. 126 schematically shows a structure of a main portion of a crossbar switch shown in FIG. 120.

FIG. 127 schematically shows a structure of a connection control signalgenerating portion of the cross bar switch shown in FIG. 120.

FIG. 128 schematically shows an overall configuration of the cross barswitch shown in FIG. 124.

FIG. 129 shows correspondence between decode signals of a decoder shownin FIG. 126 and connection buses.

FIG. 130 shows an exemplary structure of a selector shown in FIG. 120.

FIG. 131 shows an example of a data transfer path of the selector shownin FIG. 130.

FIG. 132 shows another example of the data transfer path of the selectorshown in FIG. 130.

FIG. 133 is a block diagram representing a configuration of asemiconductor integrated circuit device in accordance with Embodiment 21of the present invention.

FIG. 134 is a circuit diagram showing configurations of a decode circuitand a wired OR switch shown in FIG. 133.

FIG. 135 is a block diagram showing a main portion of a semiconductorintegrated circuit device in accordance with Embodiment 22 of thepresent invention.

FIG. 136 is a block diagram showing a main portion of a semiconductorintegrated circuit device in accordance with Embodiment 23 of thepresent invention.

FIG. 137 is a block diagram showing a main portion of a semiconductorintegrated circuit device in accordance with Embodiment 24 of thepresent invention.

FIG. 138 is a circuit diagram showing configurations of a global decodecircuit portion and a local decode circuit shown in FIG. 137.

FIG. 139 is a block diagram showing a main portion of a semiconductorintegrated circuit device in accordance with Embodiment 25 of thepresent invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiment 1

FIG. 1 schematically shows configuration of a processing systemutilizing a semiconductor processing device in accordance withEmbodiment 1 of the present invention. Referring to FIG. 1, theprocessing system includes a semiconductor processing device 1; a hostCPU 2 performing process control in semiconductor processing device 1,control of the system as a whole and data processing; a memory 3 used asa main storage of the system and storing various necessary data; and aDMA (Direct Memory Access) circuit 4 directly accessing memory 3 withoutcommunication through host CPU 2. By the control of DMA circuit 4, datacan be transferred between memory 3 and semiconductor processing device1, and semiconductor processing device can be accessed directly.

Host CPU 2, memory 3, DMA circuit 4 and semiconductor processing device1 are connected to each other through a system bus 5. Semiconductorprocessing device 1 includes a plurality of basic operation blocks FB1to FBn provided in parallel, an input/output circuit 10 transferringdata/instruction to/from system bus 5, and a central control unit 15controlling operations and processes in semiconductor processing device1.

Basic operation blocks FB1 to FBn and input/output circuit 10 arecoupled to an internal data bus 12, and central control unit 15,input/output circuit 10 and basic operation blocks FB1 to FBn arecoupled to an internal bus 14. Between adjacent basic operation blocksFB (generally representing blocks FB1 to FBn), an inter-block data bus16 is provided (in FIG. 1, an inter-block data bus 16 arranged betweenneighboring basic operation blocks FB1 and FB2 is shown as arepresentative).

By providing basic operation blocks FB1 to FBn in parallel, same ordifferent arithmetic/logic operations are executed in semiconductorprocessing device 1. These basic operation blocks FB1 to FBn are of thesame configuration, and therefore, the configuration of basic operationblock FB1 is shown as a representative example in FIG. 1.

Basic operation block FB1 includes a main processing circuitry 20including a memory and a processor; a micro program storing memory 23storing an execution program provided as a micro code; a controller 21controlling an internal operation of basic operation block FB1; aregister group 22 used as an address pointer or the like; and a fusecircuit 24 for executing a fuse program for repairing any defect of mainprocessing circuitry 20.

Controller 21 controls operations of basic operation blocks FB1 to FBn,as control is handed over by a control instruction given from host CPUthrough system bus 5 and input/output circuit 10. These basic operationblocks FB1 to FBn are each provided with micro program storing memory23, and controller 21 stores an execution program in memory 23.Consequently, the contents of processing to be executed in each of basicoperation blocks FB1 to FBn can be changed, and the contents ofprocessing of arithmetic or logical operations to be executed in each ofbasic operation blocks FB1 to FBn can be changed.

Inter-block data buses 16 for neighboring blocks are provided for datatransfer among basic operation blocks FB1 to FBn. Inter-block data bus16 allows high speed data transfer between basic operation blockswithout occupying internal data bus 12. By way of example, while a datais being transferred to a certain basic operation block through internaldata bus 12, data can be transferred between different basic operationblocks.

Central control unit 15 includes: a control CPU 25; an instructionmemory 26 storing an instruction to be executed by the control CPU; agroup of registers 27 including a working register for control CPU 25 ora register for storing a pointer; and a micro program library storingmemory 23 storing a library of micro programs. Central control unit 15receives control from host CPU 28 through internal bus 14, and controlsprocessing operations of basic operation blocks FB1 to FBn throughinternal bus 14.

Micro programs describing various sequential processes in a code formare stored as a library in micro program library storing memory 23, andtherefore, it becomes possible for central control unit 15 to select anecessary micro program and to change the micro program to be stored inmicro program storing memory 23 of basic operation blocks FB1 to FBn.Thus, it becomes possible to address any change in the contents ofprocessing in a flexible manner.

Further, by the use of fuse circuit 24, any defect in basic operationblocks FB1 to FBn can be repaired through spare (redundancy)replacement, so that production yield can be improved.

FIG. 2 schematically shows a configuration of a main portion of a mainprocessing circuitry 20 included in each of basic operation blocks FB1to FBn shown in FIG. 1. Referring to FIG. 2, main processing circuitry20 includes a memory mat 30 in which memory cells MC are arranged in amatrix of rows and columns, and a group of arithmetic logic units (ALUs)arranged on one end side of memory mat 30.

In memory mat 30, memory cells MC arranged in rows and columns aredivided into m entries ERY. Entry ERY has a bit width of n bits. InEmbodiment 1, one entry ERY consists of one column of memory cells.

The group of arithmetic logic units 32 includes an arithmetic logic unit(ALU) 34 provided for each entry ERY. Arithmetic logic unit 34 iscapable of executing addition, logical product, coincidence detection(EXOR), inversion (NOT) and others.

An arithmetic/logic operation is performed by loading and storing databetween the entry ERY and the corresponding arithmetic logic unit 34.The entry ERY consists of memory cells MCs arranged aligned in thecolumn direction of memory mat 30, and arithmetic logic unit ALU 34executes an arithmetic/logic operation in a bit-serial manner (a dataword is processed bit by bit). Therefore, in the group of arithmeticlogic units 32, arithmetic/logic operation on the data is executed in abit-serial and entry-parallel manner, in which a plurality of entriesare processed in parallel.

As the arithmetic/logic operation is executed in the bit-serial mannerin arithmetic logic unit (ALU) 34, even when the data to be subjected toarithmetic/logic operation may have different bit width, simply thenumber of operation cycles is changed in accordance with the bit widthof data word, and the contents of processing are unchanged. Therefore,data having different word configurations can readily be processed.

Further, the data of a plurality of entries ERY can be processedsimultaneously by the group of arithmetic logic units 32, and therefore,by increasing the number m of entries, collective arithmetic/logicoperations on a large amount of data becomes possible.

Here, by way of example, the number m of entries is 1024, and one entryhas a bit width of 512 bits.

FIG. 3 shows an exemplary structure of a memory cell MC shown in FIG. 2.Referring to FIG. 3, memory cell MC includes a P channel MOS transistorPQ1 connected between a power supply node and a storage node SN1 andhaving its gate connected to a storage node SN2; a P channel MOStransistor PQ2 connected between the power supply node and storage nodeSN2 and having its gate connected to storage node SN1; an N channel MOStransistor NQ1 connected between storage node SN1 and a ground node andhaving its gate connected to storage node SN2; an N channel MOStransistor NQ2 connected between storage node SN2 and the ground nodeand having its gate connected to storage node SN1; and N channel MOStransistors NQ3 and NQ4 connecting storage nodes SN1 and SN2 to bitlines BL and /BL, respectively, in response to a potential on a wordline WL.

The memory cell MC shown in FIG. 3 is a full CMOS (Complementary MetalOxide Semiconductor) type SRAM (Static Random Access Memory) cell thatperforms data writing/reading at high speed.

As the memory cell MC, a DRAM cell unit of “twin cell structure” inwhich two DRAM cells are connected in series between bit lines BL and/BL and set to a selected state by a common word line WL may be used.

When an arithmetic/logic operation is to be performed by main processingcircuitry 20, first, data to be processed are stored in each entry ERY.Thereafter, bits of a certain digit of the stored data are read inparallel from all the entries ERY and transferred (loaded) to thecorresponding arithmetic logic units 34. For a two term operation,similar transfer operation takes place on bits of different data word inrespective entries, and 2-input operation is performed by eacharithmetic logic unit 34. The result of arithmetic/logic operation isrewritten (stored) in a prescribed area of the corresponding entry fromarithmetic logic unit 34.

FIG. 4 shows an exemplary arithmetic/logic operation performed by mainprocessing circuitry 20 shown in FIG. 2. Referring to FIG. 4, data wordsa and b having the bit width of 2 bits are added to generate a data wordc. In each entry ERY, data words a and b forming a set as an object ofarithmetic/logic operation are both stored.

Referring to FIG. 4, in an arithmetic logic unit corresponding to theentry ERY of the first row, an operation of 10B+01B is performed,whereas in an arithmetic logic unit corresponding to the entry ERY ofthe second row, an operation of 00B+11B is performed. Here, “B”represents a binary number. In an arithmetic logic unit corresponding tothe entry ERY of the third row, an operation of 11B+10B is performed. Inthe similar manner, data words a and b stored in each entry are added.

The arithmetic/logic operation is performed in the bit-serial manner,starting from the lowest bits. First, in entry ERY, a lower bit a [0] ofdata word a is transferred to the corresponding arithmetic logic unit(hereinafter referred to as ALU) 34. Thereafter, a lower bit b [0] ofdata word b is transferred to the corresponding ALU 34. ALU 34 performsan addition, using 2 bits of data thus supplied. The result of additiona [0]+b [0] is written (stored) to a position of lower bit c [0] of dataword c. Specifically, in the entry ERY of the first row, “1” is writtento the position of c [0].

This addition is performed on higher bits a [1] and b [1], and theresult of operation a [1]+b [1] is written to the position of c [1].

An addition may possibly produce a carry, and such carry value iswritten to a position of c [2]. Thus, addition of data words a and bcompletes in every entry ERY, and the result is stored in each entry ERYas data c. Assuming that the number of entries m is 1024, addition of1024 sets of data can be executed in parallel.

FIG. 5 schematically shows internal timings in the addition operation.In the following, internal timings of addition will be described withreference to FIG. 5. In ALU 34, a 2-bit adder (ADD) is used.

In FIG. 5, “Read” represents an operation (load) of reading a data bitto be processed from the memory mat and transferring to thecorresponding ALU 34, and “Write” represents an operation (store) oroperation instruction of writing the data of the result of operation ofALU 34 to a corresponding bit position of the corresponding entry.

In a machine cycle k, a data bit a[i] is read from memory mat 30, in thenext machine cycle (k+1), the data bit b[i] as the next objective ofoperation is read (Read), and applied to the adder (ADD) of ALU 34.

In machine cycle (k+2), in the adder (ADD) of ALU 34, the applied databits a[i] and b[i] are added, and in machine cycle (k+3), the result ofaddition c[i] is written to the corresponding position of thecorresponding entry.

In machine cycles (k+4) and (k+5), data bits a[i+1] and b[i+1] are readand transferred to the adder (ADD) of ALU 34, in machine cycle (k+5),ALU 34 performs addition, and in machine cycle (k+6), the result ofaddition is stored in bit position c[i+1].

Transfer of a data bit between memory mat and ALU 34 requires one cycle,and ALU requires an operation cycle of one machine cycle. Therefore,addition of 2 bits of data and storage of the result of addition require4 machines cycles. The approach, in which the memory mat is divided intoa plurality of entries, sets of data to be processed are stored inrespective entries, and arithmetic/logic operation is performed bycorresponding ALUs 34 in bit-serial manner, is characterized in that arelatively large number of machine cycles are necessary for thearithmetic/logic operation of each data, whereas high speed dataprocessing can be achieved by increasing degree of parallelism ofoperations when an extremely large amount of data are to be processed.The arithmetic/logic operation is performed in the bit-serial manner,and the bit width of data to be processed is not fixed. Therefore, thisapproach can be applied to various applications having various differentdata configurations.

When the data word as the object of arithmetic/logic operation has thebit width of N, arithmetic/logic operation by each entry requires 4×Nmachine cycles. The bit width of the data word as the object ofarithmetic/logic operation is generally 8 to 64 bits. Therefore, whenthe number of entries m is set relatively large to 1024 and data of 8bit data width are to be processed in parallel, 1024 results ofarithmetic operations can be obtained after 32 machine cycles. Thus,required processing time can significantly be reduced as compared withsequential processing of 1024 sets of data.

FIG. 6 more specifically shows the configuration of main processingcircuitry 20. In memory mat 30, memory cells MC are arranged in a matrixof rows and columns, word lines WL are arranged corresponding torespective rows of memory cells, and bit line pairs BLP are arrangedcorresponding to respective columns of memory cells. Memory cells MC arearranged at intersections of the bit line pairs BLP and word lines WL.To each word line WL, memory cells of a corresponding row are connected,and to each bit line pair BLP, memory cells of a corresponding columnare connected.

Each entry is provided corresponding to each bit line pair BLP, and inmemory mat 30, entries ERY0 to ERY(m−1) are arranged corresponding tobit line pairs BLP1 to BLP(m−1), respectively. The bit line pair BLP isused as a data transfer line between the corresponding entry ERY and thecorresponding ALU 34. As the entry ERY consists of one column of memorycells, arithmetic/logic operation can be done by the corresponding ALUin bit-serial manner even when the bit width of data stored in one entryvaries dependent on application or contents of processing, and thus,change in data bit width can readily be accommodated.

For word lines WL of memory mat 30, a row decoder 46 is provided, whichdrives the word line connected to the data bits to be processed to aselected state in accordance with an address signal from controller 21(see FIG. 1). Word line WL is connected to memory cells of the sameposition of respective entries ERY0 to ERY(m−1), and by row decoder 46,data bits of the same position are selected in respective entries ERY.

In the group of arithmetic logic units (ALU group) 32, respective ALUs34 are arranged corresponding to bit line pairs BLP0 to BLP(m−1), thoughnot specifically shown in FIG. 6. Between the ALU group 32 and memorymat 30, a sense amplifier group 40 and a write driver group 42 areprovided for loading/storing (transferring) data.

The sense amplifier group 40 includes sense amplifiers providedcorresponding to respective bit line pairs BLP for amplifying data readonto the corresponding bit line pair BLP and transmitting the amplifieddata to the corresponding ALU 34 of the group of arithmetic logic units32.

Similarly, the write driver group 42 includes write drivers arrangedcorresponding to respective bit line pairs BLP for amplifying data fromthe corresponding ALU 34 of the group of arithmetic logic units 32 andtransferring the same to the corresponding bit line pair BLP.

The sense amplifier group 40 and the write driver group 42 form atransfer circuit between the bit lines (data transfer lines) and ALUs34, enabling bi-directional data transfer between the memory mat and theALUs.

For the sense amplifier group 40 and the write driver group 42, aninput/output circuit 48 is provided, and data is transferred to and frominternal data bus 12 shown in FIG. 1. The manner of data input/output ofinput/output circuit 48 is appropriately determined in consideration ofthe number of entries and the data bit width.

For the group of arithmetic logic units 32, a switch circuit 44 isfurther provided. Switch circuit 44 sets interconnection path among ALUs34 based on a control signal from controller 21 shown in FIG. 1.Therefore, as in a barrel shifter, data transfer becomes possible notonly between neighboring ALUs but also between ALUs physically separatedby a distance. Switch circuit 44 for interconnecting ALUs may beimplemented, for example, by a cross bar switch employing an FPGA (FieldProgrammable Gate Array).

Alternatively, as switch circuit 44, a structure that performs shiftingof a plurality of bits in one machine cycle, such as a barrel shifter,may be used.

FIG. 6 does not explicitly show inter-block data bus 16 of FIG. 1.Inter-block data bus 16 may be connected to switch circuit 44 forinterconnecting ALUs, or it may be connected to an internal datatransfer bus between input/output circuit 48 and groups 40 and 42 ofsense amplifiers and write drivers.

ALU 34 in the group of arithmetic logic units 32 has its timings andcontents for arithmetic/logic operation determined in accordance with acontrol signal from controller 21.

FIG. 7 shows an exemplary configuration of one ALU. Referring to FIG. 7,ALU 34 includes: arithmetic/logic operation circuit 50 performing adesignated arithmetic/logic operation; an A-register 52 temporarilystoring data read from the corresponding entry; an X-register 54temporarily storing data read from the corresponding entry, datarepresenting result of arithmetic/logic operation by arithmetic/logicoperation circuit 50 or data to be transferred to the write driver; aC-register 56 storing a carry or a borrow at the time of addition orsubtraction; and an M-register 58 storing mask data designatingprohibition of an arithmetic/logic operation by arithmetic/logicoperation circuit 50.

The sense amplifier group 40 and the write driver group 42 include, asbasic circuits forming a unit component, a sense amplifier 62 and awrite driver 60 provided corresponding to the bit line pair BLP. Senseamplifier 62 amplifies the data read from the memory cell of thecorresponding entry, and transfers the amplified data to A-register 52or X-register 54 through internal data transfer line 63. Write driver 60buffers the data stored in X-register 54 and writes to the memory cellof the corresponding entry through corresponding bit line pair BLP.

Arithmetic/logic operation circuit 50 can execute operations includingaddition (ADD), logical product (AND), logical sum (OR), exclusive OR(EXOR), inversion (NOT) and the like, and the contents of operation areset by a control signal (not shown in FIG. 7) from the controller. Whenthe mask data stored in M-register 58 is “0”, the arithmetic/logicoperation of ALU 34 is stopped, and when it is “1”, the arithmetic/logicoperation of ALU 34 is enabled. By utilizing the operation maskingfunction, it becomes possible to execute arithmetic operations oneffective entries only, where not all entries are used. Thus, accurateprocessing can be done, and as unnecessary operation is stopped, powerconsumption can be reduced.

X-register 54 is further connected to other ALUs through an inter-ALUconnecting circuit 65 included in switch circuit 44 for connecting ALUswith each other. Inter-ALU connecting circuit 65 is formed by a switchcircuit such as an FPGA cell, and used for transferring data to any ALU34 included in the group of arithmetic logic units 32. By the transferfunction of inter-ALU connecting circuit 65, arithmetic/logic operationof data stored in various physical positions in the memory mat becomespossible, and the degree of freedom in arithmetic/logic operation isincreased.

Inter-ALU connecting circuit 65 may be formed, for example, by a switchmatrix, and when the area of occupation poses a problem, the path amongALUs allowing transfer may be limited. By way of example, m entries maybe divided into groups of a plurality of blocks, and the transfer pathof inter-ALU connecting circuit 65 may be limited to allow data transferonly among the groups.

FIG. 8 shows an operation sequence of ALU 34 shown in FIG. 7. FIG. 8shows an example in which a two term addition “a+b” is executed using a1-bit adder.

First, in machine cycle (k−1), a bit “1” is set in M-register 58 todesignate execution of arithmetic operation, and C-register 56 iscleared to “0” for initialization.

In machine cycle k, data bit a[i] is read from the memory mat,transferred through sense amplifier 62 to X-register 54 and storedtherein. The value stored in X-register 54 is made valid in the nextmachine cycle (k+1).

In machine cycle (k+1), data bit b[i] is read from memory mat 30,transferred to A-register 52 and stored therein.

In machine cycle (k+2), data bits a[i] and b[i] are in definite states,so that the arithmetic/logic operation is executed by ALU 34. In machinecycle (k+3), the result of arithmetic/logic operation (result ofaddition) c[i] is written through write driver 60. In ALU 34, the resultof addition a[i]+b[i] has been fixed and whether there is a carry C[i]or not has also been fixed in machine cycle (k+2). Therefore in machinecycle (k+3), it is possible to write the result of addition in bit c[i]of the memory mat from X-register 54 of ALU 34 through write driver 60.Carry C[i] is stored in C-register 56, and writing thereof does not takeplace.

In the next machine cycle (k+4), the next higher data bit a[i+1] is readand transferred to ALU 34, and in the next machine cycle (K+5), the databit stored in X-register 54 is made valid as bit a[i+1]. In this machinecycle (k+5), bit b[i+1] is read in memory mat 30. At this time, bittransfer from the memory mat to A-register 52 of ALU 34 is in progress,while in A-register 52 (FIG. 7), data bit b[i] read in the previousmachine cycle (k+1) has been stored (in machine cycle (k+5), A-register52 is rewritten, and the stored data is made definite in machine cycle(k+6)).

In machine cycle (K+6), the data bits stored in A-register 52 andX-register 54 have been definite, and the arithmetic/logic operation(addition) is executed on these bits. In the next machine cycle (k+7),the result of addition a[i+1]+b[i+1] is written to the position of bitc[i+1]. Further, the carry C[i+1] is stored in the C-register. Byrepeating the series of operations on all bits of data words a and b ofthe corresponding entry, addition of data words a and b is achieved.After the result of addition of last bits is written, carry C stored inthe C-register is written to the most significant bit position in thestorage area of data word c.

When a word line WL is selected in memory mat 30, row decoder 46 shownin FIG. 6 stores starting points of storage areas of each bit of datawords a, b and c as pointer values of register group. By incrementingthe pointer value in every machine cycle, addition and storage of theresult of addition starting from a lower bit to a higher bit can beachieved.

As shown in FIG. 9, in an area #A for string data word a, an area #B forstoring data word b and an area #C for string word c of operation resultof memory mat 30, the positions of the least significant bit [0] aredesignated by pointers PA, PB and PC, respectively. In each machinecycle, these pointers are successively activated, and after thearithmetic/logic operation for 1 bit data is completed, the pointervalues are incremented. Here, if the bit width of areas #A and #B aredetermined in advance, addition values corresponding to the bit width ofdata areas #A and #B may be used as pointers PB and PC, based on pointerPA. These pointers PA to PC are stored in the group of registers 22shown in FIG. 1, and reapplied to row decoder 46 shown in FIG. 6.

By setting pointers PA to PC in the register group and applying the sameto the row decoder in each machine cycle successively, the area forstoring a data word in memory mat 30 can be set, in accordance with thebit width of the data word to be processed.

A counter circuit may be used for generating pointers PA to PC, orvalues stored in the register may be updated by controller 21 (see FIG.1).

As described above, according to Embodiment 1 of the present invention,the memory mat is divided into a plurality of entries, an arithmeticlogic unit is provided for each entry, and the arithmetic logic unitsperform arithmetic/logic operation in parallel in bit-serial manner, sothat a large amount of data can be processed in parallel, and thus, aprocessor capable of high speed arithmetic/logic operation regardless ofdata bit width is achieved.

Embodiment 2

FIG. 10 shows a structure of a memory cell MC of the memory mat inaccordance with Embodiment 2 of the present invention. Referring to FIG.10, memory cell MC is a dual port memory cell having a write port and aread port provided separately. For the memory cell MC, a read word lineRWL and a write word line WWL, as well as read bit lines RBL and /RBLand write bit lines WBL and /WBL are provided. The read port includes Nchannel MOS transistors NQ5 and NQ6 connecting storage nodes SN1 and SN2to read bit lines RBL and /RBL, respectively, in response to a signalpotential of read word line RWL. The write port includes N channel MOStransistors NQ7 and NQ8 connecting storage nodes SN1 and SN2 to writebit lines WBL and /WBL, respectively, in response to a signal potentialof read word line WWL.

A data storage portion of memory cell MC includes load P channel MOStransistors PQ1 and PQ2 as well as driving N channel MOS transistors NQ1and NQ2.

By using the dual port memory cell structure as shown in FIG. 10,reading and writing can be done concurrently, when arithmetic/logicoperation of data is performed in bit-serial manner. Here, the region towhich the result of arithmetic/logic operation is written is providedseparately from the region storing the data to be processed. Thereforein these memory cells, there is no conflict between the write data andthe read data, and hence, the problem of arbitration experienced in acommon multi-port memory does not occur.

FIG. 11 shows an example of internal timings in an arithmetic/logicoperation in accordance with Embodiment 2 of the present invention. Inthe following, an arithmetic/logic operation utilizing a 1-bit adder,similar to Embodiment 1 above, will be described with reference to FIG.11. The configurations of ALUs and memory mat entries are the same asthose of Embodiment 1. Therefore, in Embodiment 2 also, the memory matis divided into entries corresponding to respective columns, and an ALU34 is provided corresponding to each entry.

In machine cycle k, a data bit a[i] is read (Read). In the readingoperation, a read word line RWL corresponding to the data bit a[i] isdriven to a selected state, and storage nodes SN1 and SN2 are coupled toread bit lines RBL and /RBL, so that data bit a[i] is read.

In the next machine cycle (k+1), the next data bit b[i] is read, andapplied to an adder (ADD) of the corresponding ALU 34. In ALU 34,arithmetic/logic operation is performed in machine cycle (k+2), and thedata c[i] of the result of arithmetic/logic operation is stored in aresult register, that is, X-register 54.

In machine cycle (k+2), the next data bit a[i+1] is read from the memorymat and transferred to the ALU through read bit lines RBL and /RBL.

In machine cycle (k+3), the result of arithmetic/logic operation(a[i]+b[i]) produced in machine cycle (k+2) is written to the positionof bit c[i] of the memory mat (Write). In this writing operation, awrite word line WWL corresponding to the bit c[i] is driven to theselected state, MOS transistors NQ7 and NQ8 of the write port arerendered conductive, storage nodes SN1 and SN2 are connected to writebit lines WBL and /WBL, and the data bit from the corresponding writedriver is stored.

In this machine cycle (k+3), reading of data bit b[i+1] is performed inparallel, and the read data bit b[i+1] is transferred to ALU 34 throughread bit lines RBL and /RBL.

In machine cycle (k+4), addition of bits a[i+1] and b[i+1] is performedby the ALU. In this machine cycle (k+4), concurrently with the addition(arithmetic operation), bit a[i+2] is read from the memory mat andtransferred to the ALU.

In machine cycle (k+5), the result of operation a[i+1]+b[i+1] that wasmade definite in machine cycle (k+4) is transferred from thecorresponding write driver to bit c[i+1] through the write bit lines,and written to the corresponding memory cell through the write port.

Further, in machine cycle (k+5), in parallel with the writing, bitb[i+2] as the object of the next arithmetic/logic operation is read andtransferred to ALU 34. In machine cycle (k+5), an addition is performedin the ALU, and the result is written to the position of bit c[i+2] ofthe memory mat in machine cycle (k+6).

As described above, when a dual port memory is used, in the writing andreading operations, data bits are transferred through different paths,that is, read bit lines and write bit lines. Therefore, data transfer ofwrite data and read data can be done in parallel. Data is written oncein two cycles, and in each data machine cycle, the bit as the object ofarithmetic/logic operation can be read. As the writing and reading areperformed in parallel, the number of cycles necessary for 1-bit additionoperation can be reduced to two cycles. As for the arithmetic/logicoperation (addition) of data words having the data width of N bits,addition can be done in 2×N cycles. Namely, operation performance (speedof processing) twice as high as that of Embodiment 1 requiring 4×Ncycles can be attained. Consequently, even when addition is done in thebit-serial manner, high speed processing is possible.

In parallel with the execution of addition, the data bit to be processednext is transferred. Therefore, it is preferable to implement a registerfor storing the result of arithmetic/logic operation and a register forstoring the first transferred data bit (a[i]) to be processed byseparate register circuits, so as to prevent conflict of data. By way ofexample, in the configuration of ALU 34, the first transferred bit a[i]may be stored in A-register 52, and the result of addition may be storedin X-register 54 and transferred through the write driver, so thatconflict of the next data bit a[i+1] and the result of additiona[i]+b[i] can be prevented.

FIG. 12 schematically shows a configuration of main processing circuitry20 in accordance with Embodiment 2. In the configuration of mainprocessing circuitry 20 shown in FIG. 12 also, in memory mat 30, memorycells MC, each implemented by a dual port SRAM cell, are arranged in amatrix of rows and columns. Corresponding to each row of memory cellsMC, a write word line WWL and a read word line RWL are arranged.Corresponding to each column of memory cells MC, a write bit line pairWBLP and a read bit line pair RBLP are arranged. Each column of memorycells MC is used as an entry ERY. Here, write bit line pair WBLPconsists of write bit lines WBL and /WBL, while read bit line pair RBLPconsists of read bit lines RBL and /RBL.

The sense amplifier group 40, write driver group 42, group of arithmeticlogic units 32, switch circuit 44 for interconnecting ALUs andinput/output circuit 48 are the same as those of Embodiment 1.

Sense amplifier group 40 includes sense amplifiers SA providedcorresponding to entries ERY0 to ERY(m−1), respectively. Sense amplifierSA is connected to the read bit line pair RBLP of the correspondingentry, and coupled to the corresponding ALU of the group of arithmeticlogic units 32.

Write driver group 42 includes write drivers WD arranged correspondingto entries ERY0 to ERY(m−1), respectively. Write driver WD is connectedto the write bit line pair WBLP of the corresponding entry. Write driverWD is coupled to the corresponding ALU, and transfers the data of theresult of arithmetic/logic operation to the corresponding write bit linepair WBLP.

The read word line RWL and the write word line WWL are providedseparately, and therefore, a write row decoder 36 w selecting a writeword line WWL and a read row decoder 36 r selecting a read word line RWLare provided separately as row decoders. Row decoders 36 w and 36 r areselectively activated in accordance with a control signal or an addresssignal applied from controller 21 shown in FIG. 1, and drives thedesignated word lines RWL and WWL to the selected state. Though notexplicitly shown in FIG. 12, the addresses to row decoders 36 w and 36 rare generated utilizing a pointer, as in Embodiment 1.

In the configuration of main processing circuitry 20 in accordance withEmbodiment 2 shown in FIG. 12, memory cells MC in memory mat 30 areimplemented by dual port memory cells, read bit line pairs and write bitline pairs are provided as internal data transfer lines for writing andreading respectively, and row decoders for selecting word lines forreading and writing are provided separately. Except for these points,the shown configuration is the same as that of Embodiment 1. Write rowdecoder 36 w is activated once in two machine cycles in an additionusing a 1-bit adder, while read row decoder 36 r is activated in everycycle.

As described above, according to Embodiment 2 of the present invention,memory cells are formed by dual port memory cells, and simultaneous,parallel transfer of write data and read data between the arithmeticlogic unit and the memory mat is made possible. Thus, the time forarithmetic/logic operation can be reduced.

Embodiment 3

FIG. 13 schematically shows a configuration of a main portion of mainprocessing circuitry 20 in accordance with Embodiment 3 of the presentinvention. In main processing circuitry 20 shown in FIG. 13, memory mats30A and 30B are arranged on both sides of the group of arithmetic logicunits 32. Memory mats 30A and 30B are of the same structure, each havingm entries ERY of which data width is n bits. Between each entry ofmemory mats 30A and 30B, ALU 34 of the group of arithmetic logic units32 is arranged. ALU 34 performs a designated arithmetic/logic operationon the data of the corresponding entries of memory mats 30A and 30B.When each ALU34 is to perform a two term operation, data to be processedfor each term are stored in memory mats 30A and 30B, and the result ofoperation is stored in one of memory mats 30A and 30B. Therefore, inmemory mats 30A and 30B, the amount of data to be stored can be reducedas compared with a configuration utilizing only one memory mat. Thetotal size (bit width) of entries of memory mats 30A and 30B may be madesubstantially the same as the size (bit width) of entries of memory mat30 of Embodiment 1 or 2. The memory cell is implemented by a dual portmemory cell, as in Embodiment 2.

FIG. 14 shows internal timings of an operation sequence of mainprocessing circuitry 20 in accordance with Embodiment 3 of the presentinvention. In the following, the arithmetic/logic operation performed bymain processing circuitry 20 shown in FIG. 13 will be described.

In memory mats 30A and 30B, sets of data words a and b to be processedare stored in corresponding entries, respectively. In machine cycle k,corresponding data bits a[i] and b[i] are read from memory mats 30A and30B.

In machine cycle (k+1), an ADD operation (addition) on data bits a[i]and b[i] is performed by the ALU. In memory mats 30A and 30B, the memorycell is implemented by a dual port memory cell, and the result ofarithmetic/logic operation is stored in machine cycle (k+2) to bit c[i]of memory mat 30A. In machine cycle (k+1), the next data bits a[i+1] andb[i+1] are read and applied to the corresponding ALU, and in machinecycle (k+2), in parallel with transfer of the write data (data of theresult of operation) to bit c[i], an addition is performed on the set ofdata bits to be processed next.

In machine cycle (k+2), data bits a[i+2] and b[i+2] to be processed nextare read and transferred to ALU 34.

In machine cycle (k+3), the result of arithmetic/logic operation done byALU 34 in machine cycle (k+2) is fixed, and hence, the data of theresult of operation is written to the corresponding memory bit c[i+1].In machine cycle (k+3), still further data bits a[i+3] and b[i+3] areread and transferred to ALU 34.

In this manner, data words of each term of two term operation are storedin corresponding entries of memory mats 30A and 30B and thecorresponding data bits are read from memory mats 30A and 30B andtransferred to the ALU in the same machine cycle, whereby data can bewritten in each machine cycle. Therefore, when data words having thedata width of N bits are to be added, the arithmetic/logic operation canbe completed in N machine cycles, and thus, the speed of operation(speed of processing) can further be improved.

FIG. 15 more specifically shows the configuration of main processingcircuitry 20 according to Embodiment 3. In memory mats 30A and 30B,memory cells MC are implemented by dual port memory cells as in thememory cell structure of Embodiment 2 above, write word lines WWL andread word lines RWL are provided corresponding to memory cells alignedin the row direction and write bit line pairs WBLP and read bit linepairs RBLP are provided corresponding to the memory cells aligned alongthe column direction. These memory mats 30A and 30B each have m entriesERY0 to ERY(m−1), and these entries are arranged correspondingly betweenmemory mats 30A and 30B.

Though not explicitly shown in FIG. 15, between memory mats 30A and 30B,the group of arithmetic logic units 32 is provided. As in Embodiment 1above, a switch circuit for interconnecting ALUs is arranged for thegroup of arithmetic logic units 32, enabling data transfer between ALUsphysically distant from each other.

Between the group of arithmetic logic units 32 and memory mat 30A, asense amplifier group 40A and a write driver group 42A are arranged, andbetween the group of arithmetic logic units 32 and memory mat 30B, asense amplifier group 40B and a write driver group 42B are arranged.

Sense amplifier group 40A includes sense amplifiers SA arrangedcorresponding to read bit line pairs RBL (RBLP0-RBLP(m−1)) of memory mat30A, respectively, and write driver group 42A includes write drivers WDarranged corresponding to write bit line pairs WELP (WELP0-WELP(m−1)) ofmemory mat 30A, respectively.

Similarly, sense amplifier group 40B includes sense amplifiers SAarranged corresponding to read bit line pairs RBL (RBLP0-RBLP(m−1)) ofmemory mat 30B, respectively, and write driver group 42B includes writedrivers WD arranged corresponding to write bit line pairs WELP(WELP0-WELP(m−1)) of memory mat 30B, respectively.

For memory mat 30A, a read row decoder 36 rA selecting a read word lineRWL, and a write row decoder 36 wA selecting write word line WWL areprovided. For memory mat 30B, a read row decoder 36 rB selecting a readword line RWL, and a write row decoder 36 wB selecting write word lineWWL are provided.

An input/output circuit 49 is provided for sense amplifier group 40A andwrite driver group 42A, as well as write driver group 42B and senseamplifier group 40B, for data transfer to and from the internal data bus(bus 12 of FIG. 1).

Different from Embodiment 1, input/output circuit 49 receives andtransfers in parallel the data transferred to memory mats 30A and 30B.The data stored in memory mats 30A and 30B may have bit positionsre-arranged by the unit of memory mat, or, alternatively, each of memorymats 30A and 30B may have a register circuit for serial/parallelconversion and parallel/serial conversion, and data writing and readingword line by word line may be performed between the register circuit andthe memory mat to achieve data input/output with the outside. Otherconfiguration may be utilized.

Write row decoders 36 wA and 36 wB and read row decoders 36 rA and 36 rBare the same as those of Embodiment 2. Read row decoders 36 rA and 36 rBdrive the read word lines of the same bit position to the selected statein the same machine cycle. When the result of arithmetic/logic operationis to be stored in memory mat 30A, write row decoder 36 wA is activated,and the corresponding write word line is driven to the selected state.Here, the write row decoder 36 wB in memory mat 30B is kept in aninactive state.

As described above, according to Embodiment 3, two memory mats arearranged, the ALU group is positioned therebetween, and data sets to beprocessed are stored in respective memory mats, so that arithmetic/logicoperation, data writing and data reading can be performed in everymachine cycle, realizing high speed arithmetic operation.

Embodiment 4

FIG. 16 schematically shows a configuration of main processing circuitry20 in accordance with Embodiment 4 of the present invention. Referringto FIG. 16, in memory mat 30, dual port memory cells MC are arranged ina matrix of rows and columns. In memory mat 30, word lines WLA and WLBare arranged in orthogonally intersecting directions with each other,and bit line pairs BLPA and BLPB are arranged in orthogonallyintersecting directions with each other. Specifically, word line WLA andbit line pair BLPA are arranged parallel to each other, and word lineWLB and bit line pair BLPB are arranged parallel to each other. Formemory mat 30, a group of arithmetic logic units 32 for performing anarithmetic operation, a sense amplifier group A71 and write driver groupA73 for transferring data between memory mat 30 and the group ofarithmetic logic units 32, and a switch circuit 44 for interconnectingALUs, that is, for switching data transfer path among ALUs of the groupof arithmetic logic units (ALUs) 32 are provided.

In sense amplifier group A71, senses amplifiers SA are providedcorresponding to the bit line pair BLPA, and in write driver group A73,word drivers WD are provided corresponding to the bit line pair BLPA.Therefore, in the group of arithmetic logic units (ALUs) 32, the bitline pair BLPA forms one entry, and one ALU is provided for one bit linepair BLPA.

For the bit line pair BLPB, an input/output circuit 74 is provided fortransferring data among sense amplifier group B70, write driver groupB72 and internal data bus 12 (see FIG. 1). Sense amplifier group 70,write driver group 72 and input/output circuit 74 are for data transferthrough bit line pair BLPB between internal data bus 12 and memory mat30. Therefore, sense amplifier group 70, write driver group 72 andinput/output circuit 74 are adapted to have the same bit width as thebit width of one entry of memory mat (column decoder is not provided).

For word line WLA, a row decoder A66 is provided, and for word line WLB,row decoder B76 is provided. Row decoders A66 and B76 select word linesin accordance with an address applied from controller 21 shown in FIG.1.

In the configuration of main processing circuitry 20 shown in FIG. 16,selection of a column of memory mat 30 is not required, and therefore, acolumn decoder is not provided. Data is transferred entry by entrybetween internal data bus 12 and memory mat 30 (data is transferred inan entry-serial, bit-parallel manner), and at the time of executing anarithmetic/logic operation, data is transferred in bit-serial and entryparallel manner to the group of arithmetic logic units 32, and thearithmetic/logic operation is performed.

Specifically, in data transfer to and from internal data bus 12, a wordline WLB is selected by row decoder B76, one entry is driven to theselected state, and data is transferred to and from internal data bus 12in entry-serial and bit-parallel manner. At the time of executing anarithmetic/logic operation, to the group of arithmetic logic units 32,data of each entry is transferred in bit-serial manner, and thearithmetic/logic operation is performed in bit-serial and entry-parallelmanner.

Therefore, data transfer to and from internal data bus 12 requires timecorresponding to cycles same in number as the number of entries. For twoterm operation, it is unnecessary to store data in an area where theresult of operation is stored. Here, “0” is simply stored in the resultdata writing region.

In input/output circuit 74, when data to be processed are received inword-serial manner from internal data bus 12, at input/output circuit74, a structure may be used at a data input portion, which converts dataword (data to be processed) input in word-serial manner to parallel dataand writes the resulting data to corresponding entries through senseamplifier group 70. When transfer of only the data of the result ofoperation to internal data bus 12 is necessary, input/output circuit 74may be adapted to output only the data in the operation result data areaselectively to internal data bus 12 under the control of a controlsignal provided by controller 21, among the outputs of write drivergroup B72. Therefore, it is unnecessary to make bus width of internaldata bus 12 equal to the bit width of the entry.

FIG. 17 shows an exemplary structure of memory cell MC shown in FIG. 16.Referring to FIG. 17, memory cell MC includes cross-coupled load Pchannel MOS transistors PQ1 and PQ2 and cross-coupled drive N channelMOS transistors NQ1 and NQ2, as a storage portion. Memory cell MCfurther includes N channel MOS transistors NQA1 and NQA2 connectingstorage nodes SN1 and SN2 to bit lines BLA and /BLA in response to asignal on word line SLA, and N channel MOS transistors NQB1 and NQB2connecting storage nodes SN1 and SN2 to bit lines BLB and /BLB inaccordance with a signal potential on word line WLB.

Bit lines BLA and /BLA form a bit line pair BLPA, and bit lines BLB and/BLB form a bit line pair BLPB. Word line WLB is arranged parallel tobit lines BLA and /BLA, while word line WLA is arranged parallel to bitlines BLB and /BLB. Therefore, in memory mat 30, at the time of datawriting and arithmetic operation, the direction of the matrix can berotated by 90° to perform data transfer to the outside and data transferfor the arithmetic operation, and hence, time necessary for datatransfer to and from internal data bus 12 can be reduced.

It is noted that bit line pair BLA and /BLA and bit lines BLB and /BLBintersect at right angle to each other, and word lines WLA and WLBintersect at right angle to each other. Here, by forming word lines WLAand WLB in different interconnecting layers, and forming bit lines BLBand /BLB and bit lines BLA and /BLA in different interconnecting layers,such orthogonal intersecting arrangements of bit lines and word linescan be achieved.

As described above, according to Embodiment 4, in memory mat 30, bitlines are arranged in orthogonally intersecting directions and two setsof word lines are arranged also in orthogonally intersecting directions.Thus, when data is to be transferred to internal data bus providedoutside, the data can be transferred in entry-serial and bit-parallelmanner. Thus, time necessary for data transfer between the internal databus and the memory mat can be reduced and, as a result, high speedarithmetic/logic operation becomes possible.

Embodiment 5

FIG. 18 schematically shows an example of distribution of data to beprocessed by the processor in accordance with the present invention.Referring to FIG. 18, in memory mat 30, m entries ERY are arranged, witheach entry ERY having data bit width of n bits. For each entry ERY, anALU 34 is provided.

Assume that the data as the object of arithmetic/logic operation storedin object data area OPR are distributed only on a portion in thedirection of data bit width of entries but over all entries ERY ofmemory mat 30. In such a case, high operation performance can beattained by performing the arithmetic/logic operation in the bit-serialand entry-parallel manner.

Dependent on the contents of processing, however, the data to beprocessed might be distributed only in an area OPB across a small numberof entries, as shown in FIG. 19. In FIG. 19, the object data area OPB isdistributed over only three entries ERY, and in other entries, there isno data to be processed. In such a case, the bit-serial andentry-parallel operation would rather degrades the arithmetic/logicoperation performance, as the data bit width n is larger than the numberm of effective entries storing the data to be processed. It is importantto implement a highly versatile processor to enable efficient andhigh-speed arithmetic/logic operation even on the data having low degreeof parallelism among entries.

FIG. 20 schematically shows a configuration of the processor inaccordance with Embodiment 5 of the present invention. Referring to FIG.20, in memory mat 30, memory cells MC are arranged in a matrix of rowsand columns, as in Embodiments 1 to 4 described above. Memory cells MCarranged in the horizontal direction in FIG. 20 form one entry ERY, andfor each entry ERY, an ALU 34 is arranged in the group of arithmeticlogic units 32.

For the memory cells in the vertical direction of this figure, aprocessor group 82 is arranged, with a switch circuit 80 interposed. Inprocessor group 82, a plurality of ALUs 84 are arranged. Contents ofarithmetic operations of these ALUs can be set one by one, so that aso-called MIMD (Multi Instruction Multi Data Stream) operation can beachieved.

Switch circuit 80 connects a column of memory cells aligned in thecolumn direction of memory mat 30 to ALU 84 in processor group 82, whileswitching the connection path. Switch circuit 80 is formed, for example,by a cross-bar switch of FPGA. Alternatively, switch 80 may beimplemented by a switch matrix. Any structure that can selectivelyswitch and establish connection path between a column of memory cells ofmemory mat 30 and ALU 84 in processor group 82 may be used as switchcircuit 80.

In the configuration shown in FIG. 20, when an arithmetic/logicoperation is to be performed on data having high degree of parallelismamong entries, ALU 34 in the group of arithmetic logic units 32 arrangedon the right side of memory mat 30 is used to perform thearithmetic/logic operation in the bit-serial and entry-parallel manner,to attain high performance of parallel processing.

On the other hand, when the data to be processed have low degree ofparallelism and are distributed across a small number of entries, memorymat 30 is connected to ALU 84 executing the arithmetic/logic operation,through switch circuit 80. Here, the arithmetic/logic operation isperformed entry by entry in entry-serial, bit parallel manner.Therefore, when data a and b to be processed exist in entry ERY, thedata a and b to be processed are read in parallel, coupled to thecorresponding ALU 84 through switch circuit 80, the arithmetic/logicoperation is done, and the result of operation is stored in theoperation result storing area (c: not shown) of the corresponding entryERY.

Use of switch circuit 80 allows free setting of the area for storingdata to be processed and the area for storing the result of processingin each entry ERY. Further, as the number of entries is small, even whenthe arithmetic/logic operation is done in entry-serial manner, the timefor processing is not much increased. Particularly, where memory mat 30and processor group 82 are formed on a common chip, internal connectionlines therebetween are provided as on-chip lines, and therefore, highspeed data transfer is possible. Therefore, data can be transferred andprocessed at higher speed than in a configuration in which the memorymat and the processor ALU (84) are formed on separate chips.

Further, as the connection between the column of memory mat 30 and ALU84 of processor group 82 is set by switch circuit 80, change in bitwidth of the data to be processed can readily be adapted to. By way ofexample, assuming a configuration in which ALU 84 performs anarithmetic/logic operation of 8 bits, in processor group 82. When 16-bitdata are to be processed using this configuration, two neighboring ALUs84 may be used to provide higher and lower bytes to bit ALUs, and thearithmetic/logic operation can be done. Thus, the configuration canreadily handle data having different bit width. It is noted, however,that there is a carry propagation in an addition, and therefore, thecarry must be propagated between neighboring ALUs. For this purpose,C-register 56 shown in FIG. 7 may be provided with a shifting function,so that the carry can be propagated in parallel operation of higher andlower bytes and addition can successively be completed.

In actual signal processing, the form of data to be processed muchdiffers from application to application. Even in one specificapplication, the data form may vary process by process. Therefore, inaccordance with the form of data to be processed, whether ALU 34 ofarithmetic logic units 32 arranged on the right side of memory mat 30 orALU 84 of processor group 82 arranged below memory mat 30 is to be usedis dynamically switched under the control of controller 21 shown inFIG. 1. Thus, a processor having high arithmetic/logic operationperformance regardless of the form of data to be processed is achieved.

It is noted that whether ALU 34 of arithmetic logic units 32 arranged onthe right side of memory mat 30 or ALU 84 of processor group 82 arrangedat lower side of memory mat 30 is to be used for data processing isswitched by a control signal generated real-time in accordance with thecontents of operation from controller 21 shown in FIG. 1. Here,switching (activation/inactivation) is merely made between the rowdecoders, sense amplifiers, write drivers and ALUs either on the rightside or lower side of memory mat 30, and there is no overhead in timecaused by the switching of the manner of operation. Therefore, themanner of operation can be switched and the arithmetic/logic operationcan be executed continuously in time.

FIG. 21 more specifically shows the configuration of main processingcircuitry 20 in accordance with Embodiment 5. Referring to FIG. 21, onthe right side of memory mat 30, the group of arithmetic logic units 32for performing the arithmetic/logic operation in entry-parallel manneris arranged, and on the lower side of memory mat 30, processor group(ALU group) 82 for performing the arithmetic/logic operation in theentry-serial and bit-parallel manner is arranged. Between the group ofarithmetic logic units 32 and memory mat 30, sense amplifier group A71and write driver group A73 are arranged, and between processor group 82and memory mat 30, sense amplifier group B70 and write driver group B72are arranged.

For the group of arithmetic logic units 32, switch 44 forinterconnecting ALUs to enable transfer among ALUs is provided. Betweenprocessor group 82 and write driver group B72 and sense amplifier groupB70, switch circuit 80 is provided. Sense amplifier group B70 and writedriver group B72 are coupled to input/output circuit 87, and transferdata to and from internal data bus 12. Therefore, input/output circuit87 may have the same structure as input/output circuit 74 according toEmbodiment 3 shown in FIG. 16.

On the right side and lower side of memory mat 30, in order to transferdata to be processed, in memory mat 30, bit line pair BLPA is arrangedalong the horizontal direction of the figure and bit line pair BLPB isarranged in a direction orthogonally crossing bit line pair BLPA.Parallel to bit line pair BLPA, word line WLB is arranged, and parallelto bit line pair BLPB, word line WLA is arranged. Bit line pair BLPA iscoupled to sense amplifier group A71 and write driver group A73, and thebit line pair BLPA is coupled to respective sense amplifiers SA andwrite drivers WD.

Bit line pair BLPB is coupled to the sense amplifiers of sense amplifiergroup B70 and to the write drivers of write driver group B72. Connectionpath between the sense amplifier group B70, write driver group B72 andthe ALUs in processor group 82 is determined by switch circuit 80. Theconnection path of switch circuit 80 is set in accordance with switchinginformation from controller 21 shown in FIG. 1, and the contents ofarithmetic/logic operation executed by the ALUs in processor group 82are determined, or an ALU to be activated is designated, based onre-configuration information from controller 21.

For word line WLA, a row decoder A66 is provided, and for word line WLB,a row decoder B76 is provided. To row decoders A66 and B76, an addresssignal from controller 21 or a pointer stored in a register is applied,and one of the row decoders A66 and B76 is selectively activated bycontroller 21 in accordance with the contents of operation.

As the group of arithmetic logic units 32 on the right side or theprocessor group 82 on the lower side of memory mat 30 is selectivelyactivated by controller 21, the contents of arithmetic/logic operationcan be changed dynamically.

Memory cells MC are arranged at intersections of the word lines WLA andWLB and bit line pairs BLPA and BLPB. As for the structure of memorycell MC, the dual port memory cell structure of memory cell MC describedin Embodiment 4 with reference to FIG. 17 may be used. In this manner,efficient data transfer between data bus 12 and memory mat 30 can beachieved, and arithmetic/logic operations and processing programs can beupdated.

As described above, in Embodiment 5, ALU groups are arranged on two,orthogonally intersecting sides of the memory mat, and in accordancewith the form of data to be processed, arithmetic/logic operation can beachieved in bit-parallel and entry-serial manner or entry-serial andbit-parallel manner. Thus, high speed arithmetic/logic operation isachieved regardless of the form of data to be processed.

Further, as switch circuit 80 switching the connection path between eachcolumn of the memory mat and the processor group is provided, a set ofdata to be processed can reliably be transferred to the correspondingALU even when the set of data to be processed is arranged in one entry.Further, by the use of this switch circuit, the operation bit width ofALU can also be changed, and by changing the contents ofarithmetic/logic operation by the ALU, MIMD operation in which aplurality of instructions are executed in parallel can be achieved.

Embodiment 6

FIG. 22 schematically shows a configuration of the main processingcircuitry in accordance with Embodiment 6 of the present invention. Inthe configuration of main processing circuitry 20 shown in FIG. 22 also,memory mat 30 is divided into a plurality of (m) entries ERY, and on theright side of memory mat 30 in the figure, ALUs 34 of the group ofarithmetic logic units 32 are arranged corresponding to respectiveentries ERY. On the lower side of memory mat 30, ALUs 84 of processorgroup 82 are arranged, with a switch circuit 90 interposed. Operationbit width of the ALUs 84 of processor group 82 can be changed inaccordance with re-configuration information from controller 21, asshown in FIG. 22. By way of example, when the ALUs are adders andoperation is changed from a 8-bit operation to 16-bit operation, a carrypropagation path is connected in two ALUs performing 8-bit addition, inorder to extend the carry propagation path. A 8-bit adder or a 16-bitadder can alternatively be set simply by selectively renderingconductive a selector or a switch circuit.

When a subtraction is to be performed, by way of example, when 8-bitsubtraction to 16-bit subtraction are to be performed using two'scomplement representation, in place of the addition of “1” at the leastsignificant bit of higher byte, a carry is applied from the mostsignificant bit of the lower byte. This configuration can be readilyachieved by using a selector in accordance with the re-configurationinformation from the controller.

Therefore, when two ALUs 84 a and 84 b of processor group 82 are used toperform an arithmetic/logic operation, an ALU 88 having the bit widthcorresponding to the total bit width of ALUs 84 a and 84 b can be formedequivalently to execute the operation.

As in Embodiment 5 above, connection path of switch 90 is set inaccordance with connection path information from the controller. Whenthe data bit is changed, the ALUs 84 in processor group 82 arere-configured based on processor re-configuring information fromcontroller 21. The re-configuring information is given dynamically fromcontroller 21 in accordance with the bit width of data to be processed,and therefore, there is no overhead in time caused by re-configurationof processor group 82. Therefore, arithmetic operations can be executedon data having different data bit width at high speed.

Similar to switch circuit 80 of Embodiment 5 described above, switchcircuit 90 may be formed by using a cross-bar switch such as an FPGA, orit may be formed by a switch matrix simply switching the data transferpath.

As described above, according to Embodiment 6 of the present invention,at the time of entry-serial, bit-parallel arithmetic operation, the bitwidth of arithmetic/logic operation of processors can be variably set,and thus, high speed arithmetic/logic operation can be executed on dataof various bit width.

Embodiment 7

FIG. 23 schematically shows a configuration of a main portion of themain processing circuitry in accordance with Embodiment 7 of the presentinvention. FIG. 23 shows the configuration of a portion corresponding tothe processor group 82 arranged on the lower side of memory mat 30. Inthe configuration shown in FIG. 23, processor groups OG1 to OGk arearranged in a plurality of stages, as the processor group. Betweenmemory mat 30 and the processor groups OG1 to OGk, switches SK0, SK1,SK2, . . . are arranged. In each of the processor groups OG1 to OGk,ALUs (processors) 100 are arranged. Internal configuration and bit widthof these ALUs 100 may be changed in accordance with re-configuringinformation from the controller. All ALUs 100 may have the samestructure.

Signal processing often involves very complicated computationaloperations such as repetitive product and sum operations. Therefore, useof only one stage of ALU group may sometimes fail to providesufficiently high speed of processing. Thus, processor groups OG1 to OGkarranged in a plurality of stages are used as shown in FIG. 23, and theconnection path is set by switches SK0, SK1, SK2, . . . providedtherebetween. Further, when different arithmetic operations such asmultiplication and addition are executed successively by processorgroups OG1 to OGk arranged in a plurality of stages, processing inpipe-line manner is achieved, enabling high speed processing. Further,in one multiplication, an adding portion generating an intermediatepartial product and a final product circuit adding the intermediatepartial products and generating the final product may be achieved byALUs of respective stages, and a high-speed multiplication device can beachieved.

Further, using switch circuits SK0-SK2, . . . , connection path of ALUs100 in each group of processors OG1 to OGk is set, and therefore, a newoperation can be executed using results of arithmetic operations done byALUs physically apart from each other, and therefore, a very complicatedarithmetic/logic operation can be achieved.

As described above, according to Embodiment 7 of the present invention,processor groups are arranged in a plurality of stages in the processorgroup for entry-serial operations, and therefore, complicated arithmeticoperations can be executed at high speed.

The connection path of switch circuits SK0-SK2, . . . is designated andset in accordance with the path setting information from controller 21as in Embodiment 6 above. Switch circuits SK0-SK2, . . . may beimplemented by cross-bar switch circuits using FPGA or by a switchmatrix.

Embodiment 8

FIG. 24 schematically shows a configuration of a main portion of mainprocessing circuitry 20 in accordance with Embodiment 8 of the presentinvention. In the configuration shown in FIG. 24 also, a configurationof a processor group performing arithmetic/logic operation in theentry-serial and bit-parallel manner arranged on the lower side ofmemory mat 30 is schematically shown. In the configuration shown in FIG.24, processor groups OG1 to OGk are arranged in a plurality of stages,and between memory mat 30 and the processor groups OG1 to OGk, switchesSK0, SK1, SK2, . . . are arranged, so that the data transfer path can beselectively established.

In processor groups OG1 to OGk, the bit width of data to be processed bythe arithmetic logic unit is set to allow reconfiguration. Referring toFIG. 24, processor group OG1 includes ALUs 110, processor group OG2includes ALUs 112 of which bit width is four times that of ALU 110, andprocessor group OGk includes ALUs 114 of which bit width is twice thatof ALU 110.

By variably setting the bit width of processing by ALUs in processorgroups OG1 to OGk, it becomes possible to readily cope with any changein effective bit width of data that may possibly occur as a result ofexecuting an arithmetic operation. The bit width of each ALU inprocessor groups OG1 to OGk is set in accordance with configurationinformation from controller 21 shown in FIG. 1, and connection path ofswitches SK0, SK1, SK2, . . . is also set based on connectioninformation from the controller.

FIG. 25 schematically shows an exemplary configuration of an ALU ofwhich bit width can be re-configured. In the configuration shown in FIG.25, binary adder circuit performing addition of 8-bit data, 16-bit data,and 32-bit data is shown as an example of the processor.

Referring to FIG. 25, four 8-bit adders 120 a to 120 d are provided.These 8-bit adders 120 a to 120 d each include a carry input Ci, binaryinputs IN1 and IN2, a sum output S and a carry output C. Bit “0” isapplied to carry input Ci and bit operand data OP1 and OP2 are appliedto inputs IN1 and IN2 of 8-bit adder 120 a . To adder 120 b, 8-bitoperand data OP3 and OP4 are applied, to adder 120 c, 8-bit operand dataOP5 and OP6 are applied, and to adder 120 d, operand data OP7 and OP8are applied.

For carry input Ci of adder 120 b, a selector 122 a is provided forselecting either the carry output C of adder 120 a or bit “0”, for carryinput Ci of adder 120 c, a selector 122 b is provided for selectingeither the carry output C of adder 120 b or bit “0”, and for carry inputCi of adder 120 d, a selector 122 c is provided for selecting either thecarry output C of adder 120 c or bit “0”.

Selector 122 a selects fixed bit “0” when a ×8-bit configurationdesignating signal X8 is activated, and otherwise selects the carryoutput C of adder 120 a. Selector 122 b selects the carry output fromadder 120 b when a ×32 bit designating signal X32 designating a 32-bitword configuration is active, and otherwise selects fixed bit “0”.Selector 122 c selects fixed bit “0” in accordance with ×8-bitconfiguration designating signal X8 when 8-bit word configuration isdesignated, and otherwise selects an output signal from adder 120 c.

For adders 120 a to 120 d, a switch circuit 124 for bit width selection,receiving the signals X8, X16 and X32 as bit width selecting signals, isprovided.

When the data processing is performed based on ×8-bit configuration,selectors 122 a to 122 c select fixed bit “0”, and switching circuit 124for bit width selection selects and outputs in parallel an 8-bit sumoutput S and 1-bit carry output C outputted from each of the adders 120a to 120 d. Therefore, as the fixed bit “0” is applied to the carryinput Ci of adders 120 a to 120 d, these adders execute binary additionbased on the corresponding operand data.

For ×16-bit configuration, selector 122 a selects the carry output C ofadder 120 a, and selector 122 c selects the carry output C of adder 120c. Selector 122 b again selects fixed bit “0” in this state. Therefore,adders 120 a and 120 b operate as a 16-bit adder, and adders 120 c and120 d operate as a 16-bit adder. Here, switch circuit 124 for bit widthselection selects carry outputs of adders 120 b and 120 d in accordancewith the signal X16 designating the 16-bit data word configuration, andselects, as the sum output S, sum outputs from respective adders 120 ato 120 d. Here, switch circuit 124 for bit width selection may be formedin the following manner. The carry outputs of adders 120 a and 120 c arenot used in the ALUs of the processor groups of the subsequent stage,and therefore, an output path of switch circuit 124 is shifted by 1 bitto the lower bit direction, to generate output signals of adders 120 band 120 d. Thus, 17 bits of data including the input bit data and 1-bitcarry are outputted for adders 120 a and 120 b, and similarly, 17 bitsof data including the 16-bit sum output and 1-bit carry are outputtedfor adders 120 c and 120 d.

For ×32-bit configuration, selectors 122 a and 122 c select the carryoutputs of adders 120 a and 120 c, respectively. Selector 122 b selectsthe carry output of adder 120 b. Therefore, these adders 120 a to 120 dare connected, forming a 32-bit adder circuit. Switch circuit 124 forbit width selection selects 8-bit sum outputs of adders 120 a to 120 dand the carry output of adder 120 d in accordance with the signal X32designating ×32-bit configuration, and generates a sum output Sconsisting of 32 bits of data and a 1-bit carry output C.

By the use of switch circuit 124 for bit width selection such as shownin FIG. 25, it becomes possible to execute addition of ×16 bit data and32 bit data, utilizing adder circuits 120 a to 120 d performingarithmetic/logic operation on 8-bit data as basic units. For 64-bitdata, the configuration shown in FIG. 25 is further cascaded.

In the configuration of adders shown in FIG. 25, the carry output isselectively propagated by selectors 122 a to 122 c, realizing a ripplecarry adder, and therefore, the time of addition may possibly be longerbecause of carry propagation. To avoid such a problem, thecarry-look-ahead or carry-save addition scheme may be used.

As described above, according to Embodiment 8, for entry-serialarithmetic/logic operation, processors are arranged in a plurality ofstages, and the bit width of data to be processed by the processors ofeach stage is reconfigurable. Therefore, necessary arithmetic/logicoperation can be achieved at high speed, regardless of data bit widthand the contents of arithmetic/logic operation.

Embodiment 9

FIG. 26 shows an exemplary configuration of a processing system usingthe semiconductor device in accordance with the present invention.Similar to the configuration shown in FIG. 1, in FIG. 26, a host CPU(Central Processing Unit) 2, a DMA circuit 4 and a memory 3 areconnected to a system bus 5. Further, a semiconductor processing device1 in accordance with the present invention is connected. A plurality ofsemiconductor processing devices 1 may be provided parallel to systembus 5. In the configuration of processing system shown in FIG. 26, hostCPU 2 executes a necessary process using data stored in memory 3. Whenprocessing of a large amount of data is necessary as in the case ofimage data processing, semiconductor processing device in accordancewith the present invention takes charge of data processing.Specifically, the system configuration includes hierarchical CPUstructure of host CPU 2 and central control unit 15 in semiconductorprocessing device 1, and therefore, high speed processing becomespossible.

[First Modification]

FIG. 27 shows an exemplary system formation in accordance with a firstmodification of the processing system using semiconductor processingdevice 1 of the present invention. In the processing system shown inFIG. 27, similar to the processing system shown in FIG. 26,semiconductor processing device 1, host CPU 2, memory 3 and DMA circuit4 are connected through system bus 5. In semiconductor processing device1, basic operation blocks (FB1-FBn) are arranged in parallel as shown inFIG. 1, and in the main processing circuitry (20) in each basicoperation block, memory mat 30 is arranged. When the memory mats 30 inthese basic operation blocks are used as frame memories storing imagedata, semiconductor processing device 1 can be used as a memory macro.Namely, semiconductor processing device 1 can be used as a workingmemory for the image data processing, or semiconductor processing device1 can be used as a frame buffer.

Further, in semiconductor processing device 1, memory mat 30 consists ofSRAM cells. Therefore, when a high speed memory is to be achieved,memory mat 30 may be used as a cache memory and memory 3 may be used asa main memory, to build a high speed data processing system.

[Second Modification]

FIG. 28 schematically shows an exemplary configuration of a processor(ALU) 34 performing a bit-serial and entry-parallel arithmetic/logicoperation, included in main processing circuitry 20. Referring to FIG.28, ALU 34 includes an AND gate 132, an NOT gate 134, an EXOR gate 136,a register circuit 130 storing data for setting the contents ofarithmetic and logical operation, a selecting circuit 138 settingconnection paths among the A-register, X-register and gates 132, 134, .. . in accordance with an output signal from register circuit 130, and aselecting circuit 139 selectively coupling the outputs of gate circuits132 to 136 to C-register and X-register.

When a 1-bit multiplication is to be executed, AND gate 132 is used, andwhen addition is to be executed, AND gate 132 and EXOR gate 136 areused. For comparison, EXOR gate 136 is used. For subtraction, NOT gate134 is used and thereafter addition in two's complement representationis performed.

The contents of arithmetic/logic operation by ALU 34 are set by the datastored in register circuit 130. The data stored in register circuit 130are set by controller 21 in accordance with a program instruction storedin micro-program storing memory 23 shown in FIG. 1. Therefore, each ofthe contents of arithmetic/logic operation of ALU 34 is programmable.Accordingly, when there are a plurality of basic operation blocks FB1 toFBn as shown in FIG. 1, the semiconductor processing device 1 can beused as a programmable logic circuit realizing various logic circuits.Here, by loading program data at the time of system activation or at thetime of operating semiconductor processing device 1, the contents ofarithmetic/logic operation can be set.

The configuration in which the contents of arithmetic/logic operation ofprocessor (ALU 34) are changed in accordance with the data stored inregister circuit 130 can be similarly applied to ALU 84 and the likethat performs arithmetic/logic operation in the entry-serial andbit-parallel manner. In that case, a processing circuit such as an addercircuit, multiplier circuit or comparator circuit is selected.

[Third Modification]

FIG. 29 schematically shows a configuration of the processing system inaccordance with the third modification of Embodiment 9 of the presentinvention. In the processing system shown in FIG. 29 also, CPU 2, memory3, DMA circuit 4 and semiconductor processing device 1 are connected tosystem bus 5. In semiconductor processing device 1, a plurality of basicoperation blocks FB1 to FBn are provided in parallel, and in each ofbasic operation blocks FB1 to FBn, the main processing circuitry havingthe memory mat and the ALU group is provided. The contents ofarithmetic/logic operation of the ALU group are programmable as shown inFIG. 28 described above. Therefore, in these basic operation blocks FB1to FBn, processes may be executed independent from each other inaccordance with a micro-program stored in micro-program storing memory(23) by the controller provided inside, and the contents of processingmay be set independent from each other. Therefore, these basic operationblocks FB1 to FBn can be regarded as operation blocks of fully identicalfunction, or some can be used as a memory, some can be used as aprogrammable logic circuit and some can be used as a high speedprocessor circuit (high speed processing device performing paralleloperations). Thus, parallel processor that executes variousarithmetic/logic operation in parallel can be achieved in accordancewith the contents of arithmetic/logic operation to be done by theprocessing system, enabling high speed, high performance processingsystem.

As described above, according to Embodiment 9 of the present invention,the processing system is built using the semiconductor device of thepresent invention, and therefore, arithmetic/logic operation can be donewhile the manner of data processing can be changed dynamically in a veryflexible manner without any restriction of bit width of data to beprocessed, and in addition, various hierarchical CPU systems, ahierarchical memory system and a co-processor system can be built inflexible manner.

Embodiment 10

Generally, in an RAM (Random Access Memory), when a defect is generatedin the memory mat during wafer processing, the defective bit isequivalently repaired by replacing the defective bit with a redundantbit prepared in advance, so that the RAM can be used as a non-defectivearticle, and this circuit technique for defect repairing has beengenerally used. In the present invention, most part of the mainprocessing circuitry consists of memory cells, and therefore, it ispossible to improve production yield using the defect repairingtechnique.

FIG. 30 schematically shows a configuration of a main portion of mainprocessing circuitry 20 in accordance with Embodiment 10 of the presentinvention. Main processing circuitry 20 shown in FIG. 30 has a structuresimilar to that of main processing circuitry 20 shown in FIG. 21. It isnoted, however, that other structures of main processing circuitry inaccordance with other embodiments may be similarly adopted for mainprocessing circuitry of Embodiment 10.

The configuration of main processing circuitry 20 shown in FIG. 30differs from that of main processing circuitry 20 shown in FIG. 21 inthe following points. Specifically, between row decoder B76 and the wordline WLB of memory mat 30, a left redundancy repairing circuit 142 isprovided, and between row decoder A66 and word line WLA, an upperredundancy repairing circuit 144 is provided. Between bit line pair BLPAand the group of arithmetic logic units (ALUs) 32, a right redundancyrepairing circuit 146 is provided, and between bit line pair BLPB andprocessor group (ALU group B) 82, a lower redundancy repairing circuitis provided.

In order to set the manner of repairing by these redundancy repairingcircuits 142, 144, 146 and 148, a fuse decode circuit 140 is provided,which decodes fuse information from fuse circuit 24 shown in FIG. 1 andgenerates pieces of fuse decode information X and Y. To redundancyrepairing circuits 142 and 146, the same fuse decode information X isapplied, and to redundancy repairing circuits 144 and 148, common fusedecode information Y is applied. The reason for this is that when adefect of word line WLA is to be repaired, defect repairing is alsonecessary for the bit line pair BLPB to which the memory cells,connected to the word line WLA, are connected. Similarly, when a defectof word line WLB is to be repaired, defect repairing is also necessaryfor the bit line pair BLPA.

Redundancy repairing circuits 142 and 144 for the word lines operatesuch that in a test, memory mat 30 is accessed, while avoiding adefective address programmed in advance using various fuse elements. Inother words, these redundancy repairing circuits 142 and 144 repair adefect in accordance with the so-called “shift redundancy” method.

Redundancy repairing circuits 146 and 148 are respectively provided forALU groups 32 and 82 from the following reason. When a word line is tobe repaired by row decoder 76 and /or 66, defect repairing is alsonecessary for the bit line pairs BLPA and BLPB. By arranging redundancyrepairing circuits 146 and 148 for the bit line pairs, it becomespossible to properly execute arithmetic/logic operation in the group ofarithmetic logic units (ALUs) 32 and in processor group (ALU group B) 82using the data stored in non-defective memory cell, regardless ofwhether a defect is replaced in memory mat 30 or not.

Programming of a defective address is performed in the following manner.In wafer test, data reading and writing operations from and to thememory mat are tested, and a fusible metal line as a fuse is cut usingan energy beam such as a laser beam. Fuses for programming defectiveaddress are arranged as fuse 24 in each of basic operation blocks FB1 toFBn shown in FIG. 1. The fuse information is converted to pieces of fusedecode information X and Y using fuse decode circuit 140 shown in FIG.30. The pieces of fuse decode information X and Y are transferred toeach of the redundancy repairing circuits at the time of chipactivation, for example, to achieve repair of any defect.

FIG. 31 shows an exemplary configuration of the redundancy repairingcircuit provided for the row decoder. In FIG. 31, word lines WLn to WL(n+3) in memory mat 30 are shown as representative examples. Word lineWL of FIG. 31 represents word line WLA or WLB. In order to drive theseword lines WLn to WL (n+3) to the selected state in accordance with anaddress input, a word line decode circuit 150 is provided. Word linedecode circuit 150 corresponds to row decoder A66 or row decoder B76shown in FIG. 30.

Corresponding to outputs WOn to WO (n+2) from word line decode circuit150, fuse decode information registers 155 n to 155 (n+2) are provided,respectively. These fuse decode information registers 155 n to 155 (n+2)form shift register circuits or scan paths, and successively shift thefuse decode information generated by fuse decode circuit 140 (see FIG.30) and store the fuse decode information of the corresponding wordlines.

Further, corresponding to outputs WOn to WO (n+2) from word line decodecircuit 150, shift switching multiplexers 160 n to 160 (n+2) areprovided, for switching transfer path of the outputs WOn to WO (n+2)from word line decode circuit 150, in accordance with the data stored infuse decode information registers 155 n to 155 (n+2). These shiftswitching multiplexers 160 n to 160 (n+2) transmit, when the data storedin the corresponding fuse decode information register is “0”, thecorresponding output signal of the word line decode circuit to thecorresponding word line, and when the data stored in the correspondingfuse decode information register is “1”, transmits the correspondingoutput signal of the word line decode circuit with a shift to the upperside (having a greater word line number).

Now, assume that bit “0” is stored in fuse decode information register155 n and bit “1” is stored in fuse decode information registers 155(n+1) and 155 (n+2). In this case, shift switching multiplexer 160 ntransmits an output signal WOn of word line decode circuit 150 to thecorresponding word line WLn in accordance with the bit “0” stored infuse decode information register 155 n. Therefore, the word linessmaller number than word line WLn are supplied with output signals ofword line decode circuit 140 without shifting.

On the other hand, as bit “1” is selected and stored in fuse decodeinformation registers 155 (n+1) and 155 (n+2), shift switchingmultiplexers 160 (n+1) and 160 (n+2) transmit output signals WO (n+1)and WO (n+2) of word line decode circuit 150 to word lines WL (n+2) andWL (n+3), respectively. Therefore, word line WL (n+1) is isolated fromthe output of word line decode circuit 150, and hence, word line WL(n+1) is always kept in an inactive state. Thus, the defective word lineWL (n+1) can be always kept at a non-selected state, and the defect isrepaired for avoiding the defective address.

It is naturally understood that, in memory mat 30, in order to repairany defect by the shift redundancy method, word lines larger in numberthan the address space (number of entries) of address mat 30 must beprovided.

As described above, word lines up to word line WLn are successivelydriven to the selected state in accordance with the output signals ofword line decode circuit 150. By setting the data stored in the registercircuits corresponding to and higher than the defective word line to“1”, thereby to shift the transfer paths, word line WL (n+2) is selectedin accordance with the output signal WO (n+1) of word line decodecircuit 150. Subsequently, the correspondence between the word lines andthe outputs WO of word line decode circuit 150 is shifted by one, andnormal word lines of memory mat 30 are each driven to the selectedstate.

Specifically, by storing the bit “1” in the fuse decode informationregister corresponding to the defective word line and in the followingfuse decode information registers, the defective word line can beisolated from word line decode circuit 150, and selection of a defectiveaddress can be prevented.

FIG. 32 schematically shows a configuration of a redundancy repairingcircuit (146, 148) provided corresponding to the sense amplifier groupand the write driver group. Referring to FIG. 32, a configurationprovided for bit line pairs BLPn to BLP(n+3) of memory mat 30 is shownas a representative example. These bit line pairs BLPn to BLP(n+3) areany of bit line pairs BLPAn to BLPA (n+3) or BLPBn to BLPB (n+3).

Corresponding to bit line pairs BLPn to BLP(n+3), sense amplifiers/writedrivers 172 n to 172 (n+3) are arranged. Each of the senseamplifiers/write drivers 172 n to 172 (n+3) consists of a senseamplifier and a write driver included in the corresponding senseamplifier group and the write driver group.

Corresponding to bit line pairs BLPn to BLP(n+2), unit ALU circuitblocks 170 n to 170 (n+2) are provided. Each of the unit ALU circuitblocks 170 n to 170 (n+2) corresponds to ALU 34 or to a unit ALU (acircuit performing a 1-bit operation) included in processor group (ALUgroup B) 82.

In the BLP redundancy repairing circuit (146, 148), corresponding to bitline pairs BLPn to BLP (n+2), fuse decode information registers 180 n to180 (n+2) are provided for storing fuse decode information. These fusedecode information registers 180 n to 180 (n+2) are generated from fusedecode circuit 140 shown in FIG. 30. These fuse decode informationregisters 180 n to 180 (n+2) form a shift register circuit thattransfers the fuse decode information successively through shiftingoperation, and stores the fuse decode information of the correspondingbit lie pair.

Corresponding to these fuse decode information registers 180 n to 180(n+2), shift switching multiplexers 182 n to 182 (n+2) are provided.These shift switching multiplexers 182 n to 182 (n+2) are respectivelycoupled to sense amplifiers/write drivers 172 n to 172 (n+2) arrangedfor the corresponding bit line pairs and to sense amplifiers/writedrivers 172 (n+1) to 172 (n+3) shifted by one column to the upper side.

These shift switching multiplexers 182 n to 182 (n+2) each connect thecorresponding bit line BLP to the corresponding unit ALU circuit block170 when the data stored in corresponding fuse decode informationregisters 180 n to 180 (n+2) is bit “0”, and connect the correspondingbit line BLP to the unit ALU circuit block 170 shifted by one column tothe upper side when the data stored in corresponding fuse decodeinformation registers 180 n to 180 (n+2) is bit “1”.

It is assumed that fuse decode information register 180 n stores bit “0”and fuse decode information registers 180 (n+1) and 180 (n+2) store bit“1”, as shown in FIG. 32. In this state, shift switching multiplexer 182n couples sense amplifier/write driver 172 n provided for the bit linepair BLPn to the corresponding unit ALU circuit block 170 n. Shiftswitching multiplexer 182(n+1) couples sense amplifier/write driver172(n+2) provided for the bit line pair BLP (n+2) to unit ALU circuitblock 170 (n+1), and similarly, shift switching multiplexer 182(n+2)couples sense amplifier/write driver 172(n+3) provided for the bit linepair BLP (n+32) to unit ALU circuit block 170 (n+2).

Therefore, sense amplifier/write driver 172 (n+1) provided for bit linepair BLP(n+2) is isolated from the corresponding unit ALU circuit block170 (n+1), and not coupled to any unit ALU circuit block. The bit linepair BLP (n+1) corresponds to the defective word line WL (n+1).Therefore, as the bit line pair is replaced in conjunction with thereplacement of the defective word line, an arithmetic/logic operationcan reliably be performed by the unit ALU circuit block 170 using onlythe non-defective memory cells.

As described above, according to Embodiment 10 of the present invention,a defective cell can be repaired by redundancy replacement, and hence, adevice performing reliable arithmetic/logic operation is achieved andproduction yield can be improved.

Further, in the memory mat having word lines arranged in orthogonallyintersecting directions and the bit lines also arranged in orthogonallyintersecting direction, when a defective word line is replaced byredundancy scheme, the bit line pair corresponding to the defective wordline is also replaced by redundancy scheme. Therefore, anarithmetic/logic operation can be done reliably, using the memory cellsproperly storing data, and thus, device reliability can be ensured.

Embodiment 11

FIG. 33 schematically shows a configuration of a main portion of a basicoperation block FBi according to Embodiment 11 of the present invention.Referring to FIG. 33, memory mat 30 includes, as entries, entries withnumbers 0 to MAX_ENTRY. Each entry has bit positions 0 to BIT_MAX, andthe bit width is BIT_MAX+1.

In the group of arithmetic logic units (ALU group) 32, an arithmeticlogic unit (hereinafter also referred to as ALU unit) 34 is arrangedcorresponding to each entry. For the group 32 of arithmetic logic units34, switch circuit 44 for interconnecting ALUs is provided.

The operation of main processing circuitry 20 is set by a program (microprogram) stored in program storing memory 23. Controller 21 executesprocessing in accordance with the program stored in program storingmemory 23.

In Embodiment 1 above, program storing memory 23 stores micro programs.In Embodiment 11, the program instruction stored in program storingmemory 23 may be macro instructions rather than micro instructions.Controller 21 decodes the program instruction and executes a necessaryprocess for the operation designated by the instruction.

In register group 22, pointer registers r0 to r3 are provided, andaddresses of memory cell mat 30 of the data to be processed are storedin pointer registers r0 to r3. Controller 21 generates an addressdesignating an entry or a position in an entry of main processingcircuitry 20 in accordance with the pointers stored in pointer registersr0 to r3 to control data transfer (load/store) between memory cell mat30 and the group of arithmetic logic units 32, and sets informationdesignating connection among ALU units 34.

FIG. 34 schematically shows a configuration of arithmetic logic unit 34shown in FIG. 33. Referring to FIG. 34, in ALU 34, X-register 54 iscoupled to write driver 60 and sense amplifier 62 through an internaldata line 200. Internal data line 200 is coupled to arithmetic operationcircuit 50.

In the unit ALU circuit block (ALU unit 34) shown in FIG. 34, differentfrom the configuration shown in FIG. 7, A-register is not provided.X-register 54 temporarily stores data loaded from the memory cell of thecorresponding entry, and temporarily stores an intermediate result ofoperation by arithmetic operation circuit 50. In two term operation,when a first operation data is stored in X-register 54, the next(another) operation data is directly applied to arithmetic operationcircuit 50, and the arithmetic/logic operation is executed.

X-register 54 is coupled to another unit ALU circuit block (ALU unit)through ALU interconnecting circuit 65, and thus, data can betransferred between different ALUs.

Except for these points, the configuration of ALU unit 34 shown in FIG.34 is the same as that of unit ALU circuit block 34 shown in FIG. 7.Therefore, corresponding portions are denoted by the same referencecharacters and detailed description thereof will not be repeated.

FIG. 35 shows, in the form of a list, operation instructions (registerinstructions) corresponding to pointer registers r0 to r3 shown in FIG.33. Five instructions are prepared as register instructions.

Instruction “reg. set n, rx” is an instruction for setting a constant nin register rx. The constant n represents a bit position in an entry,and defines any value of bits 0 to MAX_BIT of one entry.

Instruction “reg. cpy rx, ry” is an instruction for copying the contentsof pointer register rx to pointer register ry.

Instruction “reg. inc rx” is an instruction for incrementing by one thevalue stored in pointer register rx.

Instruction “reg. dec rx” is an instruction for decrementing by one thevalue stored in pointer register rx.

Instruction “reg. sft rx” is an instruction for shifting the valuestored in pointer register rx one bit to the left.

By these five register instructions, the values stored in pointerregisters r0 to r3 (pointers) are operated and an address of the data tobe processed of the memory mat is designated.

FIG. 36 shows, in the form of a list, operation instructions for ALU 34shown in FIG. 34. Contents of operations defined by the ALU instructionswill be described in the following, with reference to FIG. 36.

Instruction “alu. set. #” is an instruction for setting “1” in register# (X, C or M). The ALU set instruction designates setting of a registerentry by entry.

Instruction “alu. clr. #” is an instruction for clearing the valuestored in register # to “0”.

Instruction “alu. cpy. #1#2” is an instruction for copying the valuestored in register #1 to register #2.

When this alu copy instruction is executed, inter-register data transferis executed in the ALU provided in each entry.

FIG. 37 shows load/store instructions among the ALU instructionsdefining data transfer between the memory cell mat and the ALU.

Instruction “mem. ld@rs” is an instruction for loading data from thememory cell position represented by pointer register rx to X-register.

Instruction “mem. st@rx” is an instruction for storing, when bit “1” isset in M-register (mask register 58), the data stored in X-register toan address position designated by pointer register rx.

By utilizing the memory load/store instruction, it becomes possible toperform data transfer between the memory cell and the ALU unit, usingthe value stored in pointer register rx as an address.

FIG. 38 shows, in the form of a list, instructions for moving data(Move) between entries, among the ALU instructions.

Instruction “ecm. my. n#n” defines the amount of movement of the datamoving instruction by a numerical value #n. Therefore, by thisinstruction, in transferring data of X-register 3, the value stored inthe X-register of entry j+n is moved to the X-register of entry j. Theamount of entry movement n assumes an integer value from 0 to 128, andthe data can be moved (Move) between entries that are apart by at most128 bits. Here, ENTRY_MAX is not smaller than 128.

Instruction “ecm. my. r rx” is an instruction for moving data betweenentries by the value stored in pointer register rx, and when thisinstruction is executed, the value stored in the X-register of entryj+rx is transferred to the X-register of entry j.

By utilizing instructions shown in the form of lists on FIGS. 35 to 38,it becomes possible to set data of a desired entry in the ALU unit.

FIG. 39 shows instructions for designating arithmetic/logic operation tobe performed by each unit ALU circuit block (ALU unit).

Instruction “alu. op. adc@rx” is an instruction designating addition ofdata at a memory cell address designated by pointer register rx to thedata stored in the X-register, and storing the result of addition in theX-register. In this addition, full addition is performed, and therefore,when a carry is generated, the carry is stored in C-register. InX-register (Xj), a sum Sum is generated by exclusive logical sumoperation (“̂”) of memory cell data Aj[rx] of the address designated bythe pointer register rx, bit value Xj stored in the X-register and thecarry Cj stored in the C-register, which sum is stored in theX-register.

The carry Cj is provided by a logical sum (+) of AND operations (&) ofrespective sets of bits among memory cell data Aj [rx], the bit Xjstored in the X-register, and the bit of the value Cj stored in theC-register.

The addition instruction is executed when “1” is set in the maskregister (M-register Mj), and when “0” is set in the mask register, theaddition instruction is not executed in this entry.

Instruction “alu.op.sbb@rx” is a subtraction instruction, and when thissubtraction instruction is executed, from the data Aj [rx] of the memoryaddress designated by pointer register rx, the bit value stored in theX-register is subtracted. The result of subtraction is stored in the Xregister, and a borrow is stored in the C-register.

At the time of subtraction, an inverted value !Xj of the bit Xj storedin the X-register is used and a process similar to that of addition isperformed. Therefore, when this subtraction instruction is applied, thevalue stored in the X-register is inverted and applied to the adder (thecarry of the least significant bit is set to 1).

FIG. 40 shows, in the form of a list, instruction designating logicoperations performed in the ALU.

Instruction “alu. op. and@rx” is an AND instruction. When thisinstruction is executed, a logical product (AND) of data Aj[rx] of thememory address designated by the pointer of pointer register rx and thebit value Xj stored in the X-register is provided, and the resultinglogical product is stored in the X-register. It is noted, however, thatwhen the value stored in the mask register Mj (represented by Mj) is“0”, this AND instruction is not executed. The same applies to the logicoperation instructions described below. Namely, whether the designatedoperation is executed or prohibited is determined by the value stored inthe mask register.

Instruction “alu. op. or@rx” is to perform logical sum (OR operation)between the data Aj [rx] at the memory address of pointer register rxdesignated by the pointer and the bit Xj stored in the X-register, withthe result stored in the X-register.

Instruction “alu. op. eq@rx” is an EXOR instruction to perform anexclusive logical sum operation (EXOR operation) between the data Aj[rx] at the memory address of pointer register rx designated by thepointer and the bit Xj stored in the X-register, with the result storedin the X-register.

Instruction “alu. op. not” is an NOT instruction (inversioninstruction), for inverting the value Xj of the X-register, and theresult of inversion !Xj is stored in the X-register.

When ALU 34 is formed including mask register (M-register) 58,C-register 56, X-register 54 and arithmetic operation circuit 50 and anarithmetic/logic operation is described by the combination ofinstructions shown in FIGS. 35 to 40, various arithmetic/logicoperations can be executed in a word-parallel and bit-serial manner.

FIG. 41 shows an example of a program executing the addition operationin the +basic operation block in accordance with Embodiment 11 of thepresent invention. Referring to FIG. 41, by a line number, a line ofeach operation instruction in the program is designated, an instructionto be executed is designated in the line, and after “//”, contents ofthe operation instruction to be executed are described. The contentsfollowing “//” are descriptions of the operation contents, and not anexecution instruction. The addition program shown in FIG. 41 defines abinary addition, and the process (a+b)=c is executed. The processing ofthe addition program shown in FIG. 41 will be described in thefollowing.

In line #0, “1” is set in the mask register (M-register), and the valuestored in the carry register (C-register) is cleared to “0”.

In line #1, a constant as is stored in pointer register r0, a constantbs is stored in pointer register r1, and a constant cs is stored inpointer register r2. These constants as, bs and cs represent positionsof least significant bits of operands a, b, and c of the binary additionoperation (a+b)=c in the corresponding entry.

In lines #2 and #3, an addition instruction is designated. Addition isrepeatedly executed starting from i=0 to bit width (bit_count)-1, andeach time the addition instruction is executed, the value i isincremented (i++). The contents of the function in curly brace followinga “for” sentence is repeatedly executed until the condition of “for loopinstruction” is satisfied, that is, until the value i attains the numberof the bit width to be processed.

In the loop instruction defined by the “for” sentence, the contents ofpointer register r0 is transferred (loaded) to the corresponding ALUunit and stored in the X-register, and thereafter, the data of thememory cell indicated by the pointer value stored in pointer register r1is transferred to the corresponding ALU unit and added to the valuestored in the X-register (with the value stored in the C-register). Theresult of addition is stored at an address position indicated by thepointer of pointer register r2. In the series of instructions, “ro+”,“r1+” and “r2+” represent that the pointers of pointer registers r0, r1and r2 are each incremented by one.

In line #3, the tail of instruction sequence, executed in accordancewith the loop instruction, is indicated.

When the loop instruction defined by for { } is completed and theaddition on the data bits is finished, in accordance with line #4, thevalue stored in the C-register is transferred to the X-register, andthereafter, the value stored in the X-register is stored at an addresslocation designated by pointer register r2. By this processing, thecarry of the result of addition is stored.

FIG. 42 schematically illustrates the addition operation of FIG. 41.First, the least significant bit locations as, bs and cs in the storagearea of the entry ERY of operands a, b and c are designated by thepointers of pointer registers r0, r1 and r2, respectively. Here, it isnoted that the bold letters as, bs and cs are used for distinctivelyindicating the start bit positions “as, bs and cs” as shown in thefigure. Such representation also applies to the subsequent embodiments.Thereafter, data ai and bi of the memory cells indicated by the pointersof pointer registers r0, r1 and r2 are read and added, and the result ofaddition is stored in the memory cell position indicated by pointerregister r2. When operands a and b are each 3-bit data, addition andstorage are executed with i=0˜2, and finally, the value stored in theC-register is stored in the bit position (cs+3) designated by thepointer register r2, through the X-register.

By the instruction “alu. op. adc@r1+”, the contents to be executed bythe ALU circuit (arithmetic logic operation circuit) in the ALU unit canbe set to addition.

FIG. 43 shows, an example of a subtraction program for performing asubtraction of operands a and b (a−b) and generating a subtractionresult c. A binary subtraction will be described with reference to FIG.43.

First, by line #0, M- and C-registers are initialized as in the processof addition.

In line #1, as in the process of addition, addresses of the entries ofoperands are initialized, and lowest bit positions of operands a, b andc to be processed are set in pointer registers r0, r1 and r2.

In lines #2 and #3, a loop operation instruction is designated as in theaddition executing program. By the instruction “alu. op. sbb@r1+”, aprocess for subtracting operand b from operand a is executed. The loadinstruction “mem. ld” and store instruction “mem. st” are the same as inaddition, and the arithmetic/logic operation data is transferred to theALU unit and the result of subtraction is stored in c[i] of the memorymat.

Line #3 designates the tail of contents of the loop operationinstruction.

In accordance with line #4, after the end of loop instruction designatedby lines #2 and #3 (after the end of subtraction of all bits of operandsa and b), the contents of the C-register are transferred to theX-register, thereafter, the contents of X-register are stored in thememory position designated by pointer register r2, and the borrow isstored.

As for the flow of each bit in the subtracting operation, “subtraction”is performed in place of “addition” of addition operation shown in FIG.42, and the bit flow is the same.

FIG. 44 shows an example of a multiplication program for performing amultiplication a×b=c. Referring to FIG. 44, binary multiplicationoperation will be described in the following.

First, by line #0, constants as and cs are set in pointer registers r2and r3. At the time of initialization defined by line #0, regions forthe multiplicand a and the result of multiplication c are initialized,and the region for the multiplier b is not yet set.

In line #1, by the “for” sentence, it is designated that multiplicationis repeated by the number corresponding to the bit width of the storagearea (region) of multiplicand a. Here, “a_bit_count” represents bitwidth of multiplicand a.

By the function sentence of line #2, a multiplicand bit a[j] designatedby pointer register r2 is transferred to and stored in the X-register.Thereafter, the multiplicand bit a[j] stored in the X-register is storedin the mask register (M register) (to stop multiplication, asmultiplication is unnecessary when the multiplicand bit a[j] is “0”).

By the instruction of line #3, the pointer of pointer register r3 iscopied to pointer register r0, and thereafter, constant bs is set inpointer register r1 and the initial address of multiplier b is set.

By line #4, the C-register is cleared.

By the “for” sentence of line #5, repeated processing on multiplier b isdesignated. Here, “b_bit_count” represents the bit width of multiplierb.

By the function sentence of line #6, memory cell data designated by thepointer of pointer register r0, that is, the result of multiplication,is transferred (loaded) to the X-register. Then, the multiplier bit b[i]designated by pointer register r1 is transferred to the ALU unit, andwhen the value stored in the M-register is 1, the result ofmultiplication c in the X-register and the corresponding bit b[i] ofmultiplier b are added. The addition instruction is not executed whenthe value stored in the M-register (mask register) is “0”. By thisprocessing, multiplication a[j]×b[i] is performed, and the result ofmultiplication is added to partial products up to this point.

The result of addition is transferred to and stored in the positionindicated by pointer register r0, and the counter of pointer register r0is incremented by one. The instruction defined by the function sentenceof line #6 is repeatedly executed until the condition of “for” sentenceof line #5 is satisfied, that is, on all the bits of multiplier b. Bythe addition operation, generation of partial product of one bit a[j]and addition of partial products generated so far are executed.

When processing on all the bits of one multiplier b is completed, inaccordance with line #8, the value stored in the C-register is stored inthe X-register, and the carry that has been transferred to theX-register is stored at an address position designated by pointerregister r0. Thus, the process of adding partial products is completed.

By line #9, the pointer of pointer register r3 is incremented by one,and the multiplier of the next digit is designated. The operationdefined by lines #2 to #9 is repeatedly executed on each bit ofmultiplicand a. By the series of operations, bit-serial multiplicationcan be done.

FIG. 45 schematically shows bit flow when the multiplication program ofFIG. 44 is executed. Referring to FIG. 45, a bit aj of multiplicand a isstored in the mask register (M). Thereafter, multiplication result bitcj is read and stored in the X-register, and multiplier bit bi is readand addition is done selectively. At the time of this addition, when themultiplicand bit aj stored in the mask register (M-register) is “1”, themultiplication result bit cj is added to the multiplier bit bi. When themultiplicand bit aj is “0”, addition is not performed, and themultiplication result bit cj is held in the X-register. Therefore, theresult of addition represents cj+aj×bi, and the result of addition isstored in the original bit position cj. This process is repeatedlyexecuted on all the bits of multiplier b. Thus, partial product ofmultiplier b and multiplicand bit aj is calculated and the result ofpartial product is added to the partial product bit of the correspondingdigit. Therefore, the operation of generating a partial product of eachbit of multiplicand a and adding the result to the partial productsgenerated up to that time point is repeated.

FIG. 46 schematically illustrates address allocation of an entry when adivision a/b=c . . . d is performed. A start address as of dividend a isdesignated by pointer register r0, and a start address ds of an area forstoring a reminder d is stored in pointer register r1. Divisor b andquotient s have start addresses bs and cs.

FIG. 47 shows an example of a program for performing the division.Contents of operation of the division program will be described withreference to FIG. 47.

Referring to FIG. 47, by the instruction of line #0, the mask register(M-register) of the unit ALU circuit is set, and the corresponding ALUcircuit is set to an operable state. Further, start addresses as and bsof operands a and b are set in pointer registers r0 and r1.

By line #1, a repeat sentence (“for” sentence) is described anddesignated, and the remainder is initialized. Specifically, inaccordance with pointer register r0, the dividend a is transferred toand stored in the reminder storing area designated by pointer registerr1, through the X-register. This operation is repeated on all bits ofdividend a, and in the initial state, dividend a is set as reminder d.The remainder storing area is extended in bit width at a higher bit areaof dividend a, so that it has sufficiently large bit width, and in thisarea of extended bit width, the dividend having its bit width adjustedis stored.

By the instruction of line #2, a sum of the start address cs of quotientc and a value smaller by 1 than the bit width of quotient c(bit_count-1) is set in pointer register r2. Accordingly, the mostsignificant address of the area for storing quotient c is set in pointerregister r3. By the instruction of line #2, similarly, a sum of thestart address ds of remainder d and a value smaller by 1 than the bitwidth of remainder d (bit_count-1) is set in pointer register r2.Consequently, in pointer register r2, the least significant address ofthe area storing the first bit to be subjected to division is set.

In line #3, a repeat sentence (“for” sentence) is described. Followingthe repeat sentence of line #3, instructions of lines #4 to #7 aredefined as an iteration function.

First, by line #4, the mask register (M-register) is set, and theX-register is cleared. The clear value of the X-register is stored inthe address area defined by pointer register r3, that is, the mostsignificant bit position of quotient c. Thus, the quotient isinitialized (cleared).

By the instruction of line #5, the contents of pointer register r2 arestored in pointer register r0. Thereafter, in pointer register r1, thestart address bs of the divisor is set, and the C-register is cleared.

In line #6, a repeat sentence is again described, and as an iterationfunction, the instruction of line #7 is defined. Specifically, the dataof the memory cell at an address designated by pointer register r0 isstored in the X-register, and the pointer of pointer register isincremented by one. Thereafter, the data of the memory cell at theaddress designated by pointer register r1 is subtracted from the datastored in the X-register. This process is executed repeatedly.

After the subtraction is completed, the contents of C-register aretransferred to the X-register, in accordance with the instruction ofline #9. Thereafter, the value stored in the X-register is inverted, andthe inverted value is stored in the M-register. By this operation, themagnitude relation between the divisor b and the first dividend isdetermined.

By line #10, the contents of pointer register r2 are again copied topointer register r0, the start address bs of the divisor b is againinitialized in pointer register r1, and the C-register is cleared, to beready for the next processing.

By line #11, a repeat sentence is again designated, and from the data ofthe memory cell at an address designated by pointer register r0, thedata of memory cell specified by pointer register r1 is subtracted. Atthis time, the pointer of pointer register r1 is incremented by one. Theresult of operation is stored in the X-register, the result ofsubtraction is stored at the position of memory cell address defined bypointer register r0, that is, the original reading position, and thepointer of pointer register r0 is incremented by one. This operation isrepeatedly executed.

By line #14, the value of pointer register r2 is decremented by one, andby the instruction of line #15, 1 is stored in the X-register, the valuestored in the X-register is stored in a memory cell position designatedby pointer register r3, and the value of pointer register r3 isdecremented by one.

Line #16 defines completion of the function described by the repeatsentence designated by line #1, and therefore, the process indicated bylines #2 to #15 is repeatedly executed.

Therefore, in the division program shown in FIG. 47, the divisor issubtracted from the dividend successively in a bit-serial manner, andthe subtraction is executed selectively in accordance with the magnitudeof the divisor and the dividend, whereby the divisor bit can begenerated. Further, in the area of remainder d, the dividend is stored,the position for starting operation in the remainder area issuccessively decremented and shifted to the lower bit side, wherebydigit of dividend of the division is shifted down, and the divisor issubtracted successively from the dividend to determine whether 1 holdsas the quotient. By repeating this operation, the remainder can beobtained reliably at the end of division.

FIGS. 48A to 48F show a data flow when the division program shown inFIG. 47 is executed. In the following, the division operation will bespecifically described. As shown in FIG. 48A, by the instruction of line#0, “1” is set in the mask register (M-register), and pointer registerr0 designates the least significant bit address as of dividend a.Further, pointer register r1 designates the least significant bitaddress position ds of the area for storing remainder d.

By the instruction of line #1, pointer registers r0 and r1 aresuccessively incremented to execute load/store operation, whereby thedividend a is copied in the remainder storing area. The bit width of theremainder storing area is larger than the bit width of dividend a (bitwidth wider than the sum of bit width of dividend a and divisor b isprepared).

By copying the dividend a to the lower bit area of remainder area, thehigher bit of dividend a is extended, to be ready for calculating thequotient by successively subtracting the divisor from thebit-width-adjusted dividend.

Thereafter, by the group of instructions of line #2, the positionaddress of the most significant bit of the quotient storing area is setin pointer register r3, and pointer register r2 is set to designate themost significant bit position of dividend a in the remainder storingarea.

Next, as shown in FIG. 48B, by the group of instructions of line #4, themask register (M-register) is again set to “1”, the X-register iscleared to a state of holding “0”, the value stored in the X-register isstored at the most significant bit position of the quotient storingarea, and the quotient of the previous operation cycle is cleared.

Thereafter, pointers of pointer registers r0 and r2 are transferred, andthe most significant bit position of dividend a in the remainder storingarea is designated. In this state, the pointers of pointer registers r0and r1 are successively incremented to execute the subtractingoperation, and the result of subtraction is stored in the X-register andC-register. This operation corresponds to an operation of subtractingthe divisor b from a value formed by the bits higher by the bit width ofdivisor b from the most significant bit am of the dividend a.Specifically, an operation of subtracting divisor b from the higher bitsof the digit-adjusted dividend is executed.

Thereafter, as shown in FIG. 48C, a comparison loop of the first bit ofquotient c is executed, and by the group of instructions of line #9, thecontents of C-register are transferred to the X-register, the valuestored in the X-register is inverted (NOT), and the inverted value istransferred to the M-register. When the value stored in the C-registeris “1”, there is a borrow, indicating a state that the divisor b islarger and 1 cannot hold at the most significant bit of quotient c. Whenthe value stored in the C-register is “0”, the difference value ispositive, and in that case, 1 is stored in the M-register (maskregister). When the mask register (M-register) stores “0”, thedesignated instruction is not executed. When the value stored in themask register (M-register) is “1”, an operation in accordance with thedesignated instruction is executed. Specifically, which of 0 and 1 isset as the quotient is determined by the value stored in the maskregister (M-register).

Next, as shown in FIG. 48D, by the group of instructions of lines #10and #11, again, subtraction of divisor b from the value having the mostsignificant bit am of dividend a as the least significant bit isperformed. The result of subtraction is stored in the X-register andstored in the original area of the higher area. The subtraction isperformed by successively incrementing pointers r1 and r0 (to which thepointer value of pointer r2 has been transferred). The subtractingoperation is performed when the value stored in the mask register(M-register) is “1”, and not performed when the value stored in the maskregister (M-register) is “0”. When 0 holds for the quotient, thesubtraction is unnecessary, and it is required to store 0 in thecorresponding bit of quotient c. Even for this unnecessary operation,the instruction is virtually executed without branching, as there is apossibility that 1 might hold in the division of other entries, and itis necessary to execute the division in all the entries in parallel (acommon control signal is generated to every entry from the controller).

Then, as shown in FIG. 48E, when the subtraction is completed, thepointer of pointer register r2 is decremented by one in accordance withthe instruction of line#14, 1 is set in the X-register, and at aposition indicated by the pointer of pointer register r3, “1” is stored.This process is executed when the value stored in the M-register (maskregister) is 1. When the value stored in the M-register is “0”, thevalue is not stored and “0” is maintained at the position indicated bythe pointer register r3 of the storage area for quotient c.

Thus, the pointer of pointer register r3 is decremented by one, and thenext bit position of the quotient is designated.

Thereafter, by repeating the process described above, finally, pointerregister r3 designates cs to be stored as the least significant bit ofquotient c, or point register r0 is set to a state for designating theleast significant bit ds in the remainder storing area. Thus, byrepeatedly executing the subtracting operations, the result ofsubtraction of the least significant bit of quotient c can be obtained.In the remainder storing area, the decrement value based on the resultof subtraction between dividend a and divisor b is stored (when thevalue stored in the M-register is 1).

When the dividend a in the remainder area is smaller than the divisor b,the value stored in the M-register assumes “0”, and therefore,eventually, the result of operation having quotient c=0 and remainderd=a is obtained.

When a plurality of registers are provided in the ALU unit, the divisionoperation can be achieved in the bit-serial manner using the registers.Thus, division of a plurality of data can be executed in parallel, andno matter whether the contents of division in respective entries mayhave quotient 1 or 0, the number of cycles of the operation is the same.Therefore, parallel division processing is achieved.

As described above, according to Embodiment 11 of the present invention,each unit ALU circuit block (arithmetic logic unit) in the group ofarithmetic logic units includes a mask register, a carry register and anX-register, and the arithmetic/logic operation by the processing circuitis set by the controller in accordance with a program instruction.Therefore, parallel processing can be done on a large number of words inthe bit-serial manner.

The controller may have a configuration that enables the following.Namely, the program instruction is decoded, the control signal to selecta memory cell of the memory mat (main processing circuitry) and toeffect writing/reading is generated in accordance with the result ofdecoding, and the contents of logic operation of the logic operationprocessing circuit of the ALU unit are generated by the register controlsignal and the processor selecting signal, to achieve the designatedstate of operation. Address calculation may be executed by using ageneral purpose register and a pointer register.

Embodiment 12

FIG. 49 schematically shows a configuration of the unit ALU circuitblock (ALU unit) 34 in accordance with Embodiment 12. Referring to FIG.49, ALU unit 34 includes, in addition to arithmetic/logic operationcircuit (ALU) 50, X-register 54 and C-register 56, a Y-register 200, aYa-register 201, a D-register 202, a selector (SEL) 203 selecting one ofthe values stored in Y-register 200 and Ya-register 201 in accordancewith the value stored in D-register 202 and transferring the selectedvalue to arithmetic/logic operation circuit 50, and a Z-register 204.

The Z-register 204 receives data from the arithmetic/logic operationcircuit (ALU), X-register 54 and C-register 56, and transfers the datato the X-register of another entry or to the corresponding entry ofmemory mat 30. The X-register is capable of transferring data to/fromthe register of other entries.

ALU unit 34 further includes an F-register 205, a gate circuit 206selectively transferring the value stored in the X-register 54 toarithmetic/logic operation circuit 50 in accordance with the valuestored in F-register 205, an N-register 207 storing a constant value,and a V-register 208 storing a mask bit controllingactivation/inactivation of arithmetic/logic operation circuit 50 andZ-register 204. V-register 208 provides a function similar to that ofmask register (M-register) according to Embodiment 11.

In the configuration of ALU unit 34 shown in FIG. 49, the number ofregister circuits is increased as compared to that of Embodiment 11. Byeffectively utilizing the increased number of register circuits,multiplication is executed in accordance with second order Booth'salgorithm. Second order Booth's algorithm reduces by half the number ofpartial products generated. When we represent the multiplicand by X,multiplier by Y and product by Z, the product Z can be given as:

$\begin{matrix}\begin{matrix}{Z = {X \cdot {\sum\limits_{j = 0}^{{({n - 1})}/2}{\left( {y_{{2j} - 1} + y_{2j} - {2 \cdot y_{{2j} + 1}}} \right) \cdot 2^{2j}}}}} \\{Y = \left( {y_{n},\ldots \mspace{14mu},y_{0}} \right)}\end{matrix} & (1)\end{matrix}$

From Equation (1), it can be seen that by looking at neighboring threebits of multiplier Y at one time, the number of partial productsgenerated by multiplication by multiplicand X can be reduced to one halftimes. Further, the value in the parenthesis of Equation (1) variesamong 0, ±1 and ±2. Therefore, the partial product to be added is givenas ±2×X×2^(j), ±X×2^(j) or 0. Multiplication by 2 can be implemented by1-bit left shift operation. A negative operation can be implemented byadding two's complement value.

FIG. 50 represents a procedure for generating a partial product inaccordance with second order Booth's algorithm. From equation (1), thevalue X2 j is 0 when corresponding three bits y(2 j+1), y(2 j) and y(2j−1) are all 0 or 1, and therefore shift up is unnecessary and 0 isstored (operation is not performed). Here, suffixes of multiplier bitsas shown in Equation (1) are given by the numerals in the parenthesis.

When the multiplier bit y(2 j+1) is 0 and one of multiplier bits y(2 j)and y(2 j−1) is 1, the multiplicand bit X×2^(j) is multiplied by one,and stored in the original bit position (2 j bit shift up).

When the multiplier bit y(2 j+1) is 0 and multiplier bits y(2 j) and y(2j−1) are both 1, the multiplicand bit X×2^(j) is multiplied by 2, andshifted up by further 1 bit. Thus, the bit position is shifted up by (2j+1) bits.

When the multiplier bit y(2 j+1) is 1 and multiplier bits y(2 j) and y(2j−1) are both 0, multiplication by −2 takes place, and therefore, shiftup of (2 j+1) bits is performed and the two's complement value thereofis calculated, or alternatively, the two's complement value iscalculated first and shift up of (2 j+1) bits is performed.

When the multiplier bit y(2 j+1) is 1 and one of multiplier bits y(2 j)and y(2 j−1) is 1, the multiplicand bit X×2^(j) is multiplied by −1, andtherefore the result of multiplication is shifted up by 2 j bits, andtwo's complement value thereof is calculated (or the two's complementvalue of multiplication result is shifted up by 2j bits).

FIG. 51 schematically shows the procedure of generating the partialproduct shown in FIG. 50. The multiplicand X is multiplied by the resultof decoding multiplier bits y(2 j−1), y(2 j) and y(2 j+1), to generatepartial products. Here, in accordance with the value of 3-bitmultiplier, the coefficient for the multiplicand X is any of 0, ±1 and±2.

In order to generate a partial product corresponding to the digits ofmultiplier bit y(2 j), multiplicand X is shifted by 2j digits when thecoefficient is ±1, and further shifted by one digit to the higher sidewhen the coefficient is ±2. By shifting the multiplicand X in accordancewith second order Booth's algorithm, the partial product P can begenerated.

FIG. 52 shows a specific example of generating a partial product inaccordance with second order Booth's algorithm. Referring to FIG. 52,the multiplicand a is (0111), and the multiplier b is (0110). Inaccordance with second order Booth's algorithm, in the set of multiplierbits, the even-numbered bit (y(2 j)) is used as the central bit.Therefore, the 0-th bit b[0] of the multiplier b is assumed to be y(2j). Here, multiplier bit y(2 j−1) is set to 0. In this example, from thelist of FIG. 50, an arithmetic operation of multiplication by −2 isperformed, and therefore, the multiplicand a is shifted by 1 bit andtwo's complement thereof is obtained. Consequently, (10010) iscalculated as a partial product. For bit position adjustment of theresult of multiplication, sign extension is performed always in the bitdirection, and “1” is set in the higher bits.

In generating the next partial product, the multiplier bit b[2] is usedas the multiplier bit y(2 j). Therefore, here, by multiplying themultiplier a by 2, the partial product is obtained, and as j=1, thepartial product can be obtained by a left shift of 3 bits. By addingthese partial products, the result of multiplication Z=(00101010) isobtained. In this manner, a×b=7×6=42 is obtained.

According to second order Booth's algorithm, a 4-bit multiplicationrequires two times of partial product calculation. Therefore, ascompared with calculation of partial product of each bit, the number oftimes of calculating partial products can significantly be reduced. Themultiplication according to second order Booth's algorithm is achievedby ALU unit 34 shown in FIG. 49. In the following, operationinstructions for executing second order Booth's algorithm will bedescribed.

FIG. 53 shows, in the form of a list, register instructions representingoperation on the registers in accordance with Embodiment 12 of thepresent invention. Referring to FIG. 53, in addition to registerinstructions of Embodiment 11, an instruction “reg. inc2 rx”representing an operation of incrementing by 2 by one instruction isprepared. The instruction “reg. inc2 rx” is an instruction to incrementthe pointer of pointer register rx by 2. Other register instructions arethe same as those described with reference to FIG. 35 of Embodiment 11.

FIG. 54 shows, in the form of a list, operation instructions onX-register, V-register, N-register, C-register and F-register includedin the ALU unit.

The instruction “alu. set. #R” is for setting 1 in a register #R(X-register, V-register and N-register).

The instruction “alu. clr. #RR” is for clearing the register #RR(X-register, C-register and F-register).

These set/clear instructions are the same as the set/clear instructionsamong the ALU instructions of Embodiment 11 described above. InEmbodiment 12, however, X-register, V-register and N-register can beset, and X-register, C-register and F-register can be cleared.

FIG. 55 shows, in the form of a list, inter-register transferinstruction for the registers included in the ALU unit.

The instruction “alu. cpy. #R#U” instructs an operation of copying thecontents of register #R to register #U. The copy instruction shown inFIG. 55 differs from the inter-register transfer instruction ofEmbodiment 11 simply in the names of registers used, and the contents ofoperation are the same.

FIG. 56 shows, in the form of a list, load/store instructions among theALU instructions of Embodiment 12.

The instruction “mem. 1d. #R@rx” is for storing memory cell data Aj[rx]designated by the pointer register rx to register #R (X-register,Y-register).

The instruction “mem. st@rx” is for storing the value stored in theX-register to a memory cell address Aj[rx] designated by the pointerregister rx. This store instruction is executed when the value stored inthe V-register is “1” and the corresponding ALU unit is set to theenabled state. When the mask register (V-register) is in the clearedstate, the store instruction is not executed.

FIG. 57 shows, in the form of a list, instructions for moving databetween entries.

By the instruction “ecm. mov. n#n”, the value stored in the Z-registerof an entry j+n apart by a constant n is moved to the X-register ofentry j. When data is transferred between entries, the destination ofdata transfer is determined in a cyclic manner (when the maximum entrynumber is exceeded, operation returns to the entry of the minimum entrynumber).

By the instruction “ecm. mov. r rn”, the value stored in the Z-registerof an entry j+rn apart by the value rn stored in the register rx ismoved to the X-register of entry j. For this movement also, thedestination of transfer is determined in the cyclic manner.

When data is transferred between entries in accordance with rn set in aregister, the pointer register used is any of four pointer registers r0to r3 and is determined by the storage contents of these pointerregisters.

At the time of this data transfer between entries, data is transferredfrom the Z-register to the X-register.

FIG. 58 shows, in the form of a list, instructions defining arithmeticoperations performed by the arithmetic logic unit (ALU unit).

The instruction “alu. op. adc” is for storing the data of a memoryaddress designated by the pointer register rx to the Y-register, andperforming full addition of the value stored in the Y-register and thevalue stored in the X-register. The result of addition (Sum) is storedin the Z-register, and the carry is stored in the C-register. Theaddition is executed when the N-register and the V-register are bothset.

The instruction “alu. op. sbb” is for storing the data of a memoryaddress designated by the pointer register rx to the Y-register, andperforming a subtraction of the value stored in the Y-register and thevalue stored in the X-register (Y−X). The result of subtraction isstored in the Z-register, and the borrow is stored in the C-register.The subtraction instruction is also executed when N-register 207 andV-register 208 are both set.

FIG. 59 shows, in the form of a list, arithmetic/logic operationinstructions related to the execution of second order Booth's algorithmin the ALU instructions.

The instruction “alu. op. booth” is for determining values ofconditional branching registers, that is, N-register and V-registernecessary for executing second order Booth's algorithm, using the storedvalues of (y(2 j+1), y(2 j), y(2 j−1))=(Y, X, F) that are necessary forconditional branching in second order Booth's algorithm. Before theexecution of Booth's instruction “alu. op. booth”, a 2-bit multiplier isset in each of X-register 54 and Y-register 200, using a loadinstruction. These operations are executed when mask register(V-register) 208 is set.

In the N-register, information as to whether a shift-up is to be causedby multiplication or not is set. In D-register 202, information as towhether (2 j+1) bit shift is to be done or not is stored. The value ofY-register is stored in F-register 205. Specifically, in the N-register,when the value y(2 j+1) of the Y-register is “1” and at least one of thevalues y(2 j) and y(2 j−1) stored in the X-register and F-register is“0”, “1” is set, and when the bit y(2 j+1) stored in Y-register 200 is“0” and one of the bit values y(2 j) and y(2 j−1) stored in theX-register and F-register is “1”, “1” is set in the N-register,designating a shift up.

When the value y(2 j+1) of the Y-register is “0” and the values y(2 j)and y(2 j−1) stored in the X-register and F-register are both “0”, orwhen the value stored in the Y-register is “1” and the values stored inthe X-register and F-register are both “0”, the D-register is set to“1”. The value stored in the D-register designates a shift up of (2 j+1)bits. By transferring the contents of Y-register to the F-register, themultiplier bit y(2 j+1) can be used as the multiplier bit y(2 j−1) forthe next operation with j being incremented by one.

The instruction “alu. op. exe” is for executing second order Booth'salgorithm, and conditional branching is taken in accordance with thevalues stored in the D-register and F-register.

When the value stored in the D-register is 1, the value of Ya-registeris selected by selector 203. When the value stored in the D-register is0, the value stored in the Y-register is selected. This executioninstruction (EXE instruction) is an addition instruction when the valuestored in the F-register is 0, and it is a subtraction instruction whenthe value stored in the F-register is 1.

When the execution instruction “alu. op. exe” is valid, in accordancewith the value stored in F-register 205, gate circuit 206 shown in FIG.49 performs inversion or non-inversion of the value stored in X-register54. When the Booth instruction is executed, gate circuit 206 generatescomplementary values X, !X and F, !F of the values stored in X-register54 and F-register 205.

The contents of operation of gate circuit 206 is determined by a controlsignal (ALU control) from an instruction decoder included in thecontroller.

FIG. 60 is a table showing values stored in respective registers, thatis, Y-register 200, X-register 54, F-register 205, D-register 202 andN-register 207, and corresponding contents of control (partial productgenerating procedure), when the Booth instruction shown in FIG. 58 isexecuted.

As described above, in Y-register 200, X-register 54 and F-register 20,multiplier bits y(2 j+1), y(2 j) and y(2 j−1) are set, respectively. Byexecuting the Booth instruction “alu. op. booth” in accordance with thevalues stored in the Y-register, X-register and F-register, 0 or 1 isset in D-register 202 or N-register 207. The Booth instruction completesthe preparation for calculating the partial products of multiplicand X.

The value of the F-register is used for determining whether themultiplier is to be provided as a complement or not for generating thepartial product, in combination with the values stored in the D-registerand N-register. By switching addition and subtraction, the complement ofpartial product can selectively be generated (subtraction is the same asaddition of a complement).

Further, the instruction “alu. op. exe” can be applied to operationsother than multiplication according to Booth's algorithm, and inaccordance with the value stored in D-register 202, addition orsubtraction can selectively be executed. The execution instruction “alu.op. exe” involves an addition instruction and a subtraction instruction.

By the use of Ya-register 201, a multiplier shifting operation isimplemented. In Ya-register 201, when the Booth instruction is executed,the value stored in Y-register 200 loaded last time is copied (Ya=Yj inthe EXE instruction). Therefore, when the initial value of Ya-register201 starts from 0, by three bits stored in the Y-register, Z registerand Ya-register, the state can be prepared in which a multiplier of 2bits is loaded and 1-bit multiplier is shifted. Specifically, by storingthe bit y1 from (y1, y0, 0) in the Ya-register, a set of three bits (y3,y2, y1) can be generated at the time of loading when the next Boothinstruction is executed.

FIG. 61 shows, in the form of a list, instructions for performing logicoperations, in the ALU instructions.

The instruction “alu. op. and” designates an operation of storing thememory cell data of the address designated by the pointer of pointerregister rx to the Y-register, performing a logical product operation onthe value stored in the Y-register and the X-register, and storing theresult of logical product operation in the Z-register. When theV-register (mask register) is not set, this logical product operation(AND operation) is not executed.

The instruction “alu. op. or” is for storing the memory cell data of theaddress designated by the pointer of pointer register rx to theY-register, performing a logical sum operation on the value stored inthe Y-register and the value stored in the X-register and storing theresult of logical sum operation in the Z-register. The logical suminstruction is executed when the mask register (V-register) is set.

The instruction “alu. op. exor” designates an operation of storing thememory cell data of the address designated by the pointer of pointerregister rx to the Y-register, performing an exclusive logical sumoperation on the value stored in the Y-register and the X-register, andstoring the result of operation in the Z-register. The exclusive logicalsum operation (EXOR operation) is also executed when the mask register(V-register) is set, and it is not executed when the V-register iscleared.

The instruction “alu. op. not” designates an operation of inverting thevalue stored in the X-register and storing the result of inversion inthe Z-register. This inversion instruction is not executed when theV-register is cleared, either.

The instruction “alu. op. LT” is for setting the N-register to 1 orclearing to 0 in accordance with the value stored in the C-register.When the value stored in the C-register is 1, the N-register is clearedto 0.

FIG. 62 shows a program describing, using these instructions, anoperation of multiplication in accordance with second order Booth'salgorithm. In the following, the multiplication in accordance withsecond order Booth's algorithm will be described with reference to FIG.62.

First, by the instruction of line #0, the mask register (V-register) isset, and execution of an operation is designated.

Thereafter, by the instruction of line #1, a start address of multiplierb and a start address cs of an area for storing the result ofmultiplication c are set in pointer registers r2 and r3, respectively.Further, the F-register is cleared and “0” is stored.

In line #2, a repeat sentence is described, bit width of multiplicand ais determined, and when the repeat sentence is executed, j is multipliedby 2.

According to line #3, the data bit set in pointer register r2 is storedin the X-register, and the data of the memory cell designated by pointerregister r2 is stored in the Y-register. Here, the pointer register r2is incremented by one when the instruction is executed, and therefore,by the instruction of line #3, 2 bits of multiplier, y(2 j+1) and y(2 j)are stored in the Y-register and X-register, respectively.

In accordance with line #4, Booth instruction is executed, and as can beseen from the contents of operation shown in FIG. 59, values stored inthe N-register and D-register are set, and the value stored in theY-register is copied to the F-register. Thus, the partial productgenerating procedure is set.

By the instruction of line #5, the address indicating the first bitposition of the multiplication result c stored in register r3 is copiedto pointer register r0, and the initial address (least significant bitaddress) as of the multiplicand a is set in pointer register r1.

In line #6, a repeat sentence is described, and a repetitive operationon multiplier b is executed until the condition of “for” sentence withrespect to i is satisfied. For the multiplier b, the constant irepresenting the number of times of repetition is incremented one byone.

By the instruction of line #7, the data (value of multiplication result)stored in pointer register r0 is stored in the X-register, andthereafter, the data designated by the pointer of pointer register r1,that is, the corresponding bit of multiplicand a is stored in theY-register. In this state, the Booth algorithm executing instruction(EXE instruction) is executed, addition or subtraction of multiplicandbit aj and the multiplication result bit is executed, partial productsare added, and the result of addition is stored in the Z-register.Thereafter, at the memory cell position designated by pointer registerr0, the result of addition or subtraction stored in the Z-register isstored.

Line #8 indicates the end of the repeat sentence defined by line #6.Therefore, in this function sentence, the set of 3 bits of multiplier bis decided, and generation of partial product of multiplicand a andaddition to the partial products provided up to that time point areexecuted.

Line #9 again defines a repeat sentence for the bit width of multiplierb. The process for aligning digits is performed by extending the sign ofthe partial product.

By the instruction of line #10, the data at the address positiondesignated by the pointer register r0 is stored in the X-register, andthe partial product generated in accordance with the instruction of line#7 is read. Thereafter, operation is done again in accordance withsecond order Booth's algorithm, a partial product is generated, andagain, the result of partial product generated is stored in the memorycell position designated by the pointer register r0. The pointerregister r0 designates the position of storing the result ofmultiplication c, and by incrementing the pointer of pointer registerr0, the sign bit is described at a higher bit position than that of thepartial product generated by the previous processing. The bit width ofthe generated partial product is matched with the bit width of the finalresult of multiplication c.

When the sign extension process of multiplication result c is completed,by line #12, the pointer of pointer register r3 is incremented by two.

By the description at the end of function sentence on line #13, theseries of operations on one bit aj of multiplicand a is completed, andthe process is executed on the data higher by 1 bit of the multiplicanda.

FIG. 63 shows addresses of one entry of the initial value, in connectionwith the signed Booth algorithm multiplication program shown in FIG. 62.The start position (least significant bit position) of the area storingthe multiplication result c is set by the address cs. The multiplicand ahas a bit width a_bit_count, and the least significant bit positionthereof is designated by an address as. The multiplier b has the bitwidth b_bit_count, and the least significant bit position thereof isdesignated by an address bs.

As shown in FIG. 64, first, by the instruction of line #1 of FIG. 62,the address cs is set in pointer register r3, and the address bs is setin pointer register r2.

By the instruction of line #3, the multiplication bits y(2 j) and y(2j+1) designated by pointer register r2 are stored in the X-register andY-register, respectively. Consequently, the initial values of theF-register, D-register and N-register are set by the Booth instructionof line #4. Thus, the result of decoding is designated for the partialproduct, and which of 0, ±1 and ±2 operations is to be performed is set.

Thereafter, by the instruction of line #5, the contents of pointerregister r3 are transferred to pointer register r0, and the address ofthe area for storing the result of multiplication is designated bypointer register r0. Further, the least significant bit address as ofmultiplicand a is set in pointer register r1. In accordance with theinstruction of line #7, by the pointer of pointer register r0, themultiplication result bit ci of the previous cycle is stored in theX-register, an by the pointer of pointer register r1, the bit ai ofmultiplicand a is stored in the Y-register. In accordance with thecontents stored in the D-register, one of Y-register and Ya-register isselected, and when the N-register is “1”, addition or subtraction isperformed in accordance with the value stored in the F-register. Theresult of operation is stored in the bit position from which the resultbit ci is read.

By the selection of the Ya-register and Y-register, a 2^(j) bit shit or2^(j)+1 bit shift operation is implemented.

Thereafter, the pointers of pointer registers r0 and r1 are incremented,contents of the F-register, D-register and N-register are made definite,and similar arithmetic operation is executed. Consequently,addition/subtraction of a new multiplicand is performed in bit-serialmanner, on the partial product provided up to that time point.

When these operations of generating the partial products are completed,in accordance with the instruction of line #9, at a higher bit positionof the area for storing the multiplication result, similar Boothexecution instruction is executed on the position designated by pointerregister r0. At this time, in the Y-register, the most significant bitam of multiplicand a is stored, and in the Ya-register, the second mostsignificant bit a(m−1) is stored. Therefore, the same operation as thegeneration of most significant bit of partial product described above isperformed, and the result of operation is again written to the positiondesignated by pointer register r0. Thus, sign extension process isperformed, and 0 or 1 is successively written to the higher bitpositions.

After completion of these processes, the pointer of pointer register r3is incremented by two and the value of pointer register r2 isincremented, to be ready for the next second order Booth's decodingoperation. By executing the above-described series of processes on thesets of an even-numbered bit and a neighboring odd-numbered bit ofmultiplier b, it becomes possible to obtain the final product bysuccessively generating partial products and adding to the previouspartial product, in bit-serial manner.

As can be seen from the repeat sentence of line #2 shown in FIG. 62, theaddition of partial products is completed in the operation cycles ½times the bit width of multiplier b, and thus, high speed multiplicationis possible.

The group of instructions described above can be applied not only tomultiplication according to second order Booth's algorithm but also tonormal addition/subtraction and division. Each of these operations willbe described in the following.

FIGS. 66A and 66B show an addition program using the operationinstructions in accordance with Embodiment 12. Referring to FIG. 66A, abinary addition (a+b)=c is performed. Least significant bit addresses ofoperands a, b and c are set to as, bs and cs, respectively.

FIG. 66B shows a program for performing the binary addition. In theaddition program, the same arithmetic operation as in Embodiment 11 isperformed, except that registers used have different names.

FIGS. 67A and 67B represent a program for performing a binarysubtraction in accordance with Embodiment 12 of the present invention.As shown in FIG. 67B, an operation of (a−b)=c is performed. The leastsignificant bit addresses of operands a, b and c are as, bs and cs.

FIG. 67B shows the subtraction program. In the subtraction program shownin FIG. 67B, the same arithmetic operation as in Embodiment 11 isperformed, except that operation instructions have different names, andsimilar subtraction operation can be executed in accordance with asubtraction instruction “alu. op. sbb”.

FIG. 68 shows a program of an unsigned binary multiplication usingoperation instructions in accordance with Embodiment 12 of the presentinvention. In the program shown in FIG. 68, a binary multiplication ofa×b=c is performed. The least significant bit addresses of operands a, band c are as, bs and cs.

In the multiplication program shown in FIG. 68, though the instructionsused have different names, similar processes as in Embodiment 11 areperformed, and by successively adding the bits of the same digits ofpartial products, the final product can be obtained.

FIG. 69 shows an exemplary division program using operation instructionsin accordance with Embodiment 12 of the present invention. In thedivision program shown in FIG. 69, an operation of a/b=c . . . d isperformed. The least significant bit addresses of dividend a, divisor b,quotient c and remainder d are set to as, bs, cs and ds, respectively.

In the division program of FIG. 69 also, similar processes as inEmbodiment 11 are performed using registers of different names. Bysuccessively performing subtraction of divisor b from dividend a, thequotient and remainder can be calculated.

As described above, according to Embodiment 12, a plurality of registersand gate circuits are provided in the unit ALU circuit block (arithmeticlogic unit), and Booth instruction “alu. op. booth” and Booth algorithmexecution instruction “alu. op. exe” are prepared as operationinstructions. Thus, multiplication can be done in accordance with secondorder Booth's algorithm, realizing high speed multiplication.

Embodiment 13

FIG. 70 schematically shows a configuration of unit ALU circuit block(arithmetic logic unit; ALU unit) 34 in accordance with Embodiment 13.According to Embodiment 13, in the memory mat, one entry ERY is dividedinto an even-numbered entry ERYe storing data bits A[2 i] ofeven-numbered addresses and an odd-numbered entry ERYo storing data bitsA[2 i+1] of odd-numbered addresses. By performing operations in parallelon the data bits of the same address of even-numbered entry ERYe andodd-numbered entry ERYo, speed of processing can be improved.

In ALU unit 34, cascade-connected full adders 210 and 211 forarithmetic/logic operation are provided as arithmetic/logic operationdevices. The process data of ALU unit 34 and the registers for settingthe contents of operations, that is, X-register 54, C-register 56,F-register 205, V-register 208 and N-register 207 achieve the samefunctions as those of Embodiment 12.

In Embodiment 13, ALU unit 34 further includes: an XH-register 220 andan XL-register 221 storing in parallel 2 bits of data; a selector (SEL)227 selecting, in accordance with the value stored in D-register 222, 2bits of one of the set of data from registers 54, 220 and 221; aselective inverting circuit 217 performing inversion/non-inversion on 2bits selected by selector 227, in accordance with a bit stored inF-register 205; and gates 223 and 224 selectively outputting 3-outputs Sof full adders 210 and 211 in accordance with data stored in registers207 and 208.

The outputs of two bits from selective inversion circuit 217 are appliedto A-inputs of full adders 210 and 211, respectively. XH-register 220and XL-register 221 transfer odd-numbered address bit of odd-numberedentry ERY0 and even numbered address bit of even-numbered entry ERYe,through internal data lines 226 and 228, respectively. X-register 54 isselectively connected to one of internal data lines 226 and 228 byswitch circuits Swa and SWb.

Full adder 210 has its B-input coupled to internal data line 226, and anoutput of gate 223 receiving an S-output of full adder 210 is alsoconnected to internal data line 226. Full adder 211 has its B-inputselectively connected to one of internal data lines 226 and 228 byswitch circuits SWc and SWd. An output of gate 224 receiving theS-output of full adder 211 is also selectively connected to one ofinternal data lines 226 and 228, in accordance with switch circuits Sweand SWf. By these switch circuits SWa to SWf, bit-by-bit serialprocessing of 2-bit parallel division is executed.

Gates 223 and 224 execute the designated arithmetic/logic operation whenthe values stored in V-register 208 and N-register 207 are both “1”, andotherwise, output a high impedance (set to an output high-impedancestate).

Further, the value stored in C-register 56 is connected to a carry inputCin of full adder 211. The carry output Co of full adder 210 isconnected to carry input Cin of full adder 211, and to carry input Cinof full adder 210 through a switch 225. The switch 225 separates thecarry output Co of full adder 210 and connects carry input Cin of fulladder 211 to C-register 56 when an arithmetic/logic operation is to bedone bit by bit.

In ALU unit 34 shown in FIG. 70, any Z-register is not used, andX-register 54, XH-register 220 and XL-register 221 are capable of datatransfer to and from corresponding registers of other entries.

In Embodiment 13, as pointer registers for designating addresses of thememory mat, pointer registers p0 to p3 are used. Besides, pointerregisters r0 to r3 in general purpose registers are also used.

FIG. 71 shows, in the form of a list, pointer register instructionsrelated to operations of pointer registers p0 to p3.

The instruction “ptr. set n, px” is for setting an arbitrary value n ina pointer register px. The arbitrary value n may assume any value withinthe range of the bit width (0-BIT_MAX) of one entry.

The instruction “ptr. cpy px, py” is a copy instruction for transferringand copying the contents of pointer register px to pointer register py.

The instruction “ptr. inc px” is for incrementing by one the pointer ofpointer register px.

The instruction “ptr. inc2 px” is for incrementing by two the pointer ofpointer register px.

The instruction “ptr. dec px” is for decrementing by one the pointer ofpointer register px.

The instruction “ptr. dec2 px” is for decrementing by two the pointer ofpointer register px.

The instruction “ptr. sft px” is for left-shifting by one bit thepointer of pointer register px.

By utilizing instructions “ptr. inc2 px” and “ptr. dec2 px”, 2-bitparallel processing becomes possible (odd and even addresses aresimultaneously updated).

FIG. 72 shows, in the form of a list, load/store instructions of 1-bitoperation.

Referring to FIG. 72, the instruction “mem. ld. #R@px” is for storing(loading) the data at a position Aj[px] designated by the pointerregister px to register #R.

The instruction “mem. st. #R@px” is for writing (storing) the valuestored in register #R to the memory cell position Aj[px] designated bythe pointer register px. The store instruction is not executed when themask register (V-register 208) is cleared.

The instruction “mem. swp. X@px” is for swapping the value stored in theX-register and the data at the memory cell position Aj[px] designated bythe pointer register px. The swap instruction is executed when “1” isset both in the mask register (V-register) 208 and in N-register 207. Asthe X-register is cleared/set by the data stored in the memory cell,circuit configuration can be simplified.

FIG. 73 shows, in the form of a list, load/store instructions for theALU unit in 2-bit operation.

Referring to FIG. 73, the instruction “mem2. ld. X@px” is for storingthe data of memory cell positions Aj[px] and Aj[px+1] designated by thepointer register px to XL register 221 and XH-register 220. Specificallya lower bit of data at continuous address positions is stored in theXL-register and a higher bit is stored in the XH-register.

The instruction “mem2. str. X@px” is for storing values stored in theXL-register and the XH-register, respectively, to the memory cells ofcontinuous addresses Aj[px] and Aj[px+1] designated by the pointerregister px. This operation is not executed when the mask register(V-register) is cleared.

The instruction “mem2. swp. X@px” is for swapping the data at theaddress Aj[px] designated by the pointer register px and a higheraddress Aj[px+1] with the values stored in the XL-register andXH-register, respectively. The swap instruction is not executed when theV-register and the N-register are both cleared.

In the 2-bit operation, successive addresses Aj[px] and Aj[px+1] areaccessed simultaneously using the pointer of pointer register px,whereby parallel processing of 2 bits is implemented.

FIG. 74 shows, in the form of a list, instructions for moving data(move) between entries, of 1-bit operation. When data is moved betweenentries, the pointer register rn is used. Candidates of the pointerregister rn for moving data between entries include four pointerregisters r0 to r3.

The instruction “ecm. my. n #n” is for transferring the value stored inthe X-register of an entry j+n apart by a constant n to the X-registerof entry j.

The instruction “ecm. my. r m” represents an operation in which thevalue of X-register of entry j+rn apart by a value stored in theregister rn is transferred to the X-register of entry j.

The instruction “ecm. swp” instructs an operation of swapping the valuesstored in the X-registers of neighboring entries j+1 and j.

FIG. 75 shows, in the form of a list, operations of moving (move) databetween entries in the ALU for 2-bit operation. In the 2-bit operation,instruction descriptor “ecm2” is used in place of instruction descriptor“ecm”. By the designation of instruction descriptor “ecm2”,arithmetic/logic operation 2-bits by 2-bits is defined, parallel datatransfer between XH- and XL-registers is performed, and for thedesignation of contents to be transferred between the registers, thesame instruction descriptors as the 1-bit operation, that is, “my. n#n”,“my. r rn” and “swp” are used.

FIG. 76 shows, in the form of a list, arithmetic operation instructionsof the ALU unit for 1-bit operation.

The instruction “alu. adc@px” is an addition instruction. The data atthe memory address Aj[px] indicated by the pointer of pointer registerpx is added to the value Xj stored in the X-register, and the result zis stored in the original memory cell. Specifically, in the memory cellat address Aj[px], Sum (sum) of the addition is stored, and a carry isstored in the C-register.

The instruction “alu. sbc@px” is a subtraction instruction. From thedata at the memory address Aj[px] indicated by the pointer of pointerregister px, the value Xj stored in the X-register is subtracted, andthe result of subtraction is stored in the original memory positionAj[px]. After the subtraction, the value of a result of subtraction isstored in the original memory cell, and the borrow is stored in theC-register.

The instruction “alu. inv@px” is an inversion instruction. The data atthe memory address Aj[px] indicated by the pointer of pointer registerpx is inverted and stored in the original memory position.

These addition, subtraction and inversion instructions are executed whenthe N-register and the V-register are both set, and not executed wheneither one of the N-register and the V-register is cleared.

The instruction “alu. let f” is a register setting instruction. A valuedesignated by a function value f (4 bits) are stored in correspondingone of the F-register, D-register, N-register and C-register(f=F×8+D×4+N×2+C).

FIG. 77 shows, in the form of a table, arithmetic operation instructionsof the ALU unit for 2-bit operation. FIG. 77 shows instructions forperforming a multiplication in 2-bit by 2-bit manner, in accordance withsecond order Booth's algorithm.

The instruction “alu2. booth” is a Booth instruction. When the Boothinstruction is executed, from the values stored in the XH-register,XL-register and the F-register, the values to be stored in theN-register, D-register and F-register are obtained for preparation forthe next operation. The Booth instruction is executed when theV-register is set. The contents executed by the Booth instruction areset based on the result of Booth decoding at the time of executing theBooth instruction, as will be described in the following.

The instruction “alu2. exe@px” is a Booth instruction executinginstruction (EXE instruction), by which a shift operation and anon-inversion/inversion operation are performed in accordance withvalues stored in the D-register and the F-register.

The contents of multiplication operation in accordance with Booth'salgorithm will be described specifically in the following.

FIG. 78 shows, in the form of a list, values stored in the D-registerand N-register when the Booth instruction shown in FIG. 77 is executed.

When the Booth instruction is executed, multiplier bits y(2 j+1), y(2 j)and y(2 j−1) are stored in the XH-register, XL-register and F-register.Therefore, the bit values of the D-register and N-register are the sameas in Embodiment 12, and when the bit “1” is stored in the N-register, ashift operation is designated, and when the bit “1” is stored in theD-register, a shift-up by (2 j+1) bits is designated. When the bit “1”is stored in the XH-register, a complement is generated at the time of ashift-up.

When the Booth instruction is executed, the value stored in theXH-register is transferred to the F-register and to the C-register.Thus, for the next operation, the multiplier bit y(2 j−1) is stored inthe F-register.

In the X-register, the initial value “0” is stored. By using the initialstored value of the X-register, a value corresponding to the multiplierbit shifted by 1 bit can be obtained.

When the Booth executing instruction (EXE instruction) is executed,first, the memory cell data Aj[px] designated by the pointer register pxis added to the value stored in the XH-register or XL-register or to theinverted value thereof, and the result of addition is stored in theoriginal memory cell position Aj[px]. The carry is used as a carry forthe operation of the next memory address Aj[px+1]. Here, using the carrycc, the memory cell data at the address Aj[px+1] is added to the valuestored in the XH-register or XL-register or to the inverted valuethereof, and the result of addition is stored in the original memorycell position Aj[px+1]. Further, the value of X-register is changed tothe value stored in the XL-register, when the value stored in theD-register is 1. Thus, at the time of (2 j+1) bit shift, yi(=2 j) can bestored as the multiplier bit in the X-register.

FIG. 79 shows a program describing a Booth algorithm multiplicationprocess in accordance with Embodiment 13 of the present invention. Leastsignificant bits of multiplicand a, multiplier b and the result ofmultiplication c are as, bs and cs, respectively. Here, for simplicityof description, it is assumed that the multiplier b and the multiplicanda have the same bit width bit count.

First, by the group of instructions on line #0, the least significantbit address bs of multiplier b is set in the pointer register p2, andthe least significant bit address cs of the result of multiplication isset in the pointer register p3.

In line #1, the “for” sentence designates the range of the set ofmultiplier bits of the Booth algorithm (i is incremented by 2i).

By the instruction of line #2, first, the data of addresses Aj[p2] andAj[p2+1] designated by the pointer register p2 are stored in theXH-register and XL-register, respectively. Then, the Booth instructionis executed, and the values of N-register, D-register and F-register areset.

By the instruction of line #3, the pointer value cs of pointer registerp3 is copied to the pointer register p, and the least significant bitaddress as of the multiplicand a is set in the pointer register p1.

By line #4, 2-bit by 2-bit process is executed, and therefore, the rangeof change and the amount of increment of the address j of themultiplicand are set.

By the instruction on line #5, the multiplicand bit designated bypointer register p1 are stored in the XH-register and the XL-register,respectively. Then, using the data of the memory cells designated by thepointer register p0, that is, the partial product of the previous cycleand the multiplicand bit designated by the pointer register p1, theBooth execution instruction is performed. When the instruction of line#5 is executed, pointer values of pointers p0 and p1 are incremented bytwo (incremented by two addresses), as 2-bit processing is performed.

This process is repeatedly executed by the number designated by j.Therefore, for all the bits of multiplicand a, generation of partialproduct and addition to the partial product generated in the previouscycle are performed in accordance with second order Booth's algorithm2-bits by 2-bits, and the result of addition is stored in the partialproduct storing area.

By line #6, the end of function defined by the “for” sentence of line #4is designated. When a set of one multiplier bit is completed, again the“for” sentence is described on line #7, designating sign extendingprocess of 2-bit basis. Specifically, in accordance with the executioninstruction of line #8, the sign extending process is performed in thearea designated by the pointer register r0, that is, the higher bit areaof partial product storing area, and the sign extension is performed upto the most significant bit position.

Line #9 designates completion of the function defined by the “for”sentence of line #7. When the sign extension process ends, the pointerof pointer register p3 is incremented by two, in accordance with theinstruction of line #10.

Line #12 designates the tail of the “for” sentence of line #1, and thus,using the next set of multiplier bits of multiplier b, generation ofpartial product and addition to the partial product of the previouscycle are again executed 2-bits by 2-bits.

In the program of FIG. 79, pointer registers p1, p2 and p3 areincremented by two. In the memory cell mat of the main processingcircuitry, however, bits of the even and odd addresses are stored at thesame bit positions of the even-numbered and odd-numbered entries asdescribed above, and in address control of the memory cell mat, bitposition in the entry is updated bit by bit.

FIG. 80 schematically shows connection of unit ALU circuit block 34 forthe 2-bit operation. When 2-bit operation is to be performed,particularly when multiplication is to be performed in accordance withBooth's algorithm, X-register 54 is coupled to internal data line 226through a switch circuit SWa. Switch circuit SWb is set to disconnectX-register 54 from internal data line 228.

Switch circuit SWd couples the B-input of full adder 211 to internaldata line 228, and switch circuit SWc separates the B-input of fulladder 211 from internal data line 226. Switch circuit 225 disconnectsthe carry output Co of full adder 210 from the carry input Cin of fulladder 210. C-register 56 is coupled to the carry input Cin of full adder210, with switch circuit 225 interposed. The output of gate circuit 224is coupled to internal data line 228 by switch circuit SWf.

In the 2-bit operation, full adders 210 and 211 operate in parallel, andwhen the execution instruction (EXE instruction) of FIG. 77 is executed,they output the result zz of addition for bits Aj[px] and Aj[px+1] inparallel.

In the memory cell mat, in the even-numbered entry ERYe and odd-numberedentry ERYo, data bits of even address A[2 i] and odd address A[2 i+1]are stored, respectively. By the pointer register px, the memory cellsof the same bit position of the even-numbered entry ERYe andodd-numbered entry ERYo are designated. Therefore, when the program isexecuted, as the px counter value of the pointer register is incrementedby 2, the bit positions of the even-numbered entry ERYe and odd-numberedentry ERYo are shifted to the higher bit side by 1 bit. This operationof incrementing the pointer of pointer register rx can be implementedsimply by word line switching, when the address for selecting the wordline of the memory cell mat is generated based on the pointer of pointerregister px.

FIG. 81 schematically shows a data flow when a multiplication is done inaccordance with second order Booth's algorithm. FIG. 81 first shows thedata flow when the Booth instruction is executed. The entry is dividedinto the even-numbered entry ERYe and odd-numbered entry ERYo. The leastsignificant bit address bs of multiplier b is set in the pointerregister p2, and the least significant bit address cs of the result ofmultiplication c is set in the pointer register p3. By executing thegroup of instructions of line #2 shown in FIG. 79, 2 bits of multiplierb designated by the pointer register p2 (bits b1 and b0 of FIG. 81) arestored in the XH-register and XL-register. In the initial state, theX-register and F-register are initialized to “0”.

In this state, in accordance with the contents of operation shown inFIG. 77, the values to be stored in the D-register and N-register aredetermined, and after the values of D-register and N-register are set,the bit (b1) stored in the XH-register is stored in the F-register.Thus, the state is prepared in which the multiplier bit y(2 j+1) is setas the y(2 j−1) bit when the next partial product is to be generated.

FIG. 82 schematically shows the data bit flow when the Booth executioninstruction (EXE instruction) is executed. The value stored in thepointer register p3 is transferred to the pointer register p0, and theleast significant bit address as of multiplicand a is set in the pointerregister p1. Then, 2 bits (a1 and a0) of multiplicand a are stored inthe XH-register and XL-register, respectively. The selector (SEL; 227)selects one of the XH-register and XL-register and one of the X-registerand XH-register.

A selective inverter (217) selectively inverts the output bit of theselector (SEL) in accordance with the value stored in the F-register, togenerate bits x1 and x2 to be added. These are added (2-bit addition) to2 bits (c0, c1) of the partial product read in accordance with thepointer value of pointer register p0, by full adders 210 and 225. Theresult of addition is selectively stored in the original position, inaccordance with the bit stored in the N-register.

By the selecting operation by the selector (SEL), at the time of 2j bitshift, ±1 multiplication is performed in accordance with values storedin the XH-register and XL-register, to be added to the correspondingpartial product, and the result of addition is stored in the originalpartial product bit position. At the time of 2j+1 bit addition shift,the multiplicand bit read in the previous cycle is added to thecorresponding partial product without using the values stored in theXH-register and XL-register, and as a result, a 2j+1 bit shift isimplemented. Here, values of the D-register, F-register and N-registerare fixed when an entire partial product is generated, and thus, thecontents of selection by the selector (SEL) and the selective inverterare fixed. Thus, generation of partial products by 2j bit shift and 2j+1bit shift and addition to previous partial product can be performedaccurately.

The pointers of pointer registers p1 an dp0 are incremented two by two,the positions of entries ERYe and ERYo are shifted 1-bit by 1-bitequivalently, and thus, generation of partial product and addition tothe previous partial product are executed 2 bits by 2 bits.

After this operation, in accordance with the instructions on lines #8and #9, sign extension of the generated partial product is performed,and the sign bits are successively stored in higher bit positions.

As shown in FIG. 70, as two full adders 210 and 211 are provided in ALUunit 34 and 2-bit addition is performed, generation of partial productand addition to the previous partial product can be done 2-bits by2-bits.

Further, as shown in FIG. 77, the Booth execution instruction (EXEinstruction) causes either addition or subtraction in accordance withthe value stored in the F-register, and therefore, this executioninstruction involves addition or subtraction.

Addition and subtraction can also be executed 2-bits by 2-bits, or 1-bitby 1-bit. Division, however, is done 1-bit by 1-bit, as it is necessaryto perform subtraction with the bit positions of the dividendright-shifted one by one. In order to implement such 1-bit operation,switch circuit 225 of FIG. 80 is provided.

FIG. 83 schematically shows an exemplary connection of ALU unit 34 for1-bit addition/subtraction. In the connection for 1-bit operation,X-register 54 is connected to internal data lines 226 and 228 throughswitch circuits SWa and SWb, respectively, and the output of X-register54 is selected by selector 227. Connection of switches SWa and SWb isdetermined by pointer px.

In accordance with the bit stored in F-register 205,addition/subtraction is performed by selective inverter 217. The outputof selective inverter 217 is applied to the A-input of full adder 211.The B-input of full adder 210 is connected to internal data line 226.The carry output Co of full adder 210 is separated from the carry inputCin of full adder 210 by switch circuit 225, and the sum output S offull adder 210 is coupled to internal data line 226 through gate 223.Full adder 210 is not used for addition. The carry input Cin of fulladder 211 is coupled to C-register 56 through switch circuit 225. TheB-input of the full adder is selectively coupled to internal data line226 or 228, through switch circuits SWc and SWd, in accordance with thepointer px. Further, the sum output S of full adder 211 is selectivelyconnected to internal data lines 226 and 228, through gate 224 andswitches SWe and SWf.

When the subtraction is to be achieved by addition of two's complement,“1” is stored as the initial value in C-register 56, and the bit valuefrom X-register 54 is inverted by selective inverter 217. For addition,C-register 56 is cleared to “0”, as the initial state.

In the entry, data bits of successive addresses A(2 i) and A(2 i+1) arestored in the areas connected to internal data lines 226 and 228, andthe data are transferred to the X-register 54 through internal datalines 226 and 228.

FIG. 84 shows an example of a program for performing a two termaddition, using ALU 34 of 1-bit configuration. In the binary additionprogram shown in FIG. 84, the instruction “mem. Id. C 0” is for storingthe data bit “0” stored in a specific area of the memory mat to theC-register. If the C-register were provided with a set/reset function,circuit structure would be complicated. Therefore, a clear bit forresetting is stored in a specific area, and using the clear bit, theC-register is set to the cleared state.

In the two term addition operation, a+b=c is performed. By theF-register 205, selective inverter 217 is set to the non-invertingstate, and a bit of addend b designated by the pointer register p1 isadded to the corresponding bit of the augend a designated by the pointerregister p0. By the addition instruction, as shown in FIG. 76, the sumis stored in the original bit position of augend a, and the addition(a+b)=c is achieved. By changing the connection of X-register 54 and thefull adder in accordance with the pointer of pointer register px,addition can successively be done on the data bits of even-numbered andodd-numbered entries.

FIG. 85 shows an example of a binary subtraction. In the binarysubtraction, a=(a−b) is performed. In the program shown in FIG. 85, theinstruction “men. ld. C 1” is for setting 1 in the C-register, and bygenerating two's complement of subtrahend b, addition of the complementand the minuend a is executed.

Selective inverter 217 is set as an inverter in accordance with thevalue stored in the F-register. The result of addition is stored in theoriginal position of minuend a. Switching of switches SWa to SWf is donein accordance with the pointer of pointer register px, as in theaddition operation.

FIG. 86 shows an example of a multiplication program for unsignedmultiplication 1-bit by 1-bit. The least significant bits ofmultiplicand a, multiplier b and the result of multiplication c are as,bs and cs, respectively.

The least significant bit addresses bs and cs are set in the pointerregisters p2 and p3, respectively. Thereafter, the corresponding bit ofthe multiplier b designated by pointer register p2 is stored inN-register 207, and the process of gate 224 receiving the sum output Sumof full adder 211 is set. The position for storing the multiplicationresult of pointer register p3 is copied to pointer register p0. TheC-register is cleared and the initial state is set. The start address ofmultiplicand a is set in the pointer register p1, and the bit ofmultiplicand a is loaded to X-register 54. Using full adder 211, thecorresponding bit of the result of multiplication is added to the bit ofmultiplicand a.

The result of addition is stored in the address location designated bythe pointer register p0 only when the value stored in N-register 207is 1. Thus, multiplication of bits bi and ai as well as addition to thepartial product can be done. After generation of the partial product,the carry stored in the C-register is stored at the most significant bitposition of the partial product.

At the time of this multiplication, the bit bi of multiplier b is fixed,and a whole of partial product is generated. After the whole partialproduct is generated, the pointer p3 designating the least significantbit position of the partial product is incremented by one, so as todesignate a new partial product. Thereafter, the bit position ofmultiplier b is incremented and then the next multiplication isperformed. In this manner, multiplication can be done bit by bitsuccessively. For this multiplication also, connection of switchcircuits SWa to SWf is controlled by even-number/odd-number of each ofthe pointers.

FIG. 87 shows a program for performing a division. In the division,a/b=c . . . d is executed. In the division program shown in FIG. 87, byan operation instruction “alu. let(0b0011)” of a function sentencedefined by the “for” sentence, the F-register, D-register, N-registerand C-register are initialized ((0,0,1,1) are set in these registers).

The instruction “mem. st. C tp” designates an operation of storing thevalue tp stored in the C-register in a specific area of the memory.

The operation instruction “alu. inv. tp” designates an operation ofinverting the specific bit tp for rewriting to the original memoryposition.

The instruction “mem. ld. N tp” designates an operation of storing theinverted specific bit value tp to the N-register.

By executing the series of instructions, the selector SEL is set to astate of selecting the output of X-register, selective inverter 217 to astate for performing inversion, and subtracting operation “alu. sbc@p0”is achieved.

In the division operation, 2-bits of data are stored in the XH-registerand XL-register, and stored in the remainder storing area of the entry.In the operation of copying the dividend, it is copied 2-bits by 2-bits,and thus, the speed of processing for generating a remainder isimproved. Circuit connection of the ALU is set to the state in which onefull adder 211 is used, as in the addition/subtraction andmultiplication operations.

Thereafter, the divisor b is stored bit by bit in the X-register, whichis subtracted from the dividend a with the digits aligned in theremainder storing area, and the result of subtraction is storedselectively in the original remainder storing area, in accordance withthe value stored in the N-register.

Thus, the magnitude relation between divisor b and dividend a isdetermined (the value of carry tp in the C-register is determined), andbased on the magnitude relation, the value to be stored in theN-register is set. The next subtracting operation is done selectively,using the addition operation, in accordance with the value stored in theN-register. By the addition, the original value of the remainder area isselectively recovered (when the quotient bit is 0, it is necessary toperform the subtracting operation with the bit position shifted). As aquotient bit, the inverted value of the value stored in the N-registeris set. Thereafter, bit positions of the quotient and the remainder areaare right-shifted by 1 bit, and the similar operation is repeated.

When subtraction is to be done in bit-serial manner, the B-input of fulladder 211 is selectively connected to internal data lines 226 and 228 byusing switch circuits SWc and SWd, and X-register 54 is connectedalternately to internal data line 226 and 228 using switch circuits SWaand SWb.

Therefore, as in the addition/subtraction and multiplication operationsdescribed above, division can be performed in bit-serial manner on thedata of the storage areas in the even-numbered and odd-numbered entries.

It is noted that addition and subtraction can be performed 2-bits by2-bits, using both full adders 210 and 211.

FIG. 88 schematically shows an exemplary construction of a path forwriting data in a distributed manner to even-numbered entry ERYe andodd-numbered entry ERYo of one entry ERY. Referring to FIG. 88, atransposing memory 230 transforms external data EW applied from theoutside in a word-serial and bit-parallel manner to bit-serial andword-parallel data MW and transfers the same to a memory data bus MDB.To memory data bus MDB, bit line pairs forming the odd-numbered entryERYo and the even-numbered entry ERYe are connected, through columnselection gates CSGo and CSGe. Column selecting gates CSGo and CSGe areselectively rendered conductive in response to column selecting signalsCLo and CLe.

The column selecting signals CLo and CLe are driven to the selectedstate dependent on whether the least significant bit px[0] of thepointer register px (x=0−3) is an even/odd number. Thus, theeven-numbered bit and the odd-numbered bit of the word-parallel andbit-serial memory data MW read from the transposing memory 230 can bedistributed to the even-numbered entry ERYe and the odd-numbered entryERYo, respectively.

In the configuration shown in FIG. 88, when the even-numbered entry ERYeand the odd-numbered entry ERYo are to be used as separate entries, theleast significant bit px[0] of the pointer register rx is fixed to 0 or1 until data is written to all the entries, and after writing to all theentries, the least significant bit px[0] of the pointer register px ischanged. Thus, it becomes possible to write a data word in theeven-numbered entry area and thereafter to write another data word tothe odd-numbered entry area, and the data can be stored entry by entry.

As described above, in accordance with Embodiment 13, even-numberedentry and odd-numbered entry are provided, and full adders operatingparallel to each other are provided in the arithmetic logic unit, sothat ALU processing can be performed 2-bits by 2-bits. Consequently,high speed processing becomes possible.

Embodiment 14

FIG. 89 schematically shows a configuration of a main portion of thesemiconductor signal processing device in accordance with Embodiment 14of the present invention. In the configuration shown in FIG. 89, to ALUunits 34 included in the group of arithmetic logic units 32, an ALUcontrol signal from controller 21 is commonly applied trough an ALUcontrol line. The ALU units 34 (arithmetic logic units) are arrangedcorresponding to the entries ERY of memory cell mat 30, respectively.

In the configuration shown in FIG. 89, it is possible to execute acommon arithmetic/logic operation in the entries ERY included in memorymat 30. Thus, a single instruction, multi data (SIMD) scheme can readilybe implemented.

The ALU control signal from controller 21 is generated from the resultof decoding a program stored in the micro instruction memory shown, forexample, in FIG. 1.

As described above, in accordance with Embodiment 14 of the presentinvention, an ALU control line is provided commonly to unit ALUs of thegroup of arithmetic logic units to transmit a common control signal.Thus, a common ALU operation can be executed readily in each of theentries.

Embodiment 15

FIG. 90 schematically shows a configuration of a main portion of themain processing circuitry in accordance with Embodiment 15 of thepresent invention. In the configuration shown in FIG. 90, memory cellmat 30 is divided into two sub-mats 30 a and 30 b. The group ofarithmetic logic units 32 is also divided into ALU groups 32 a and 32 b,corresponding to memory sub-mats 30 a and 30 b. To ALU group 32 a, anALU control signal from an ALU control circuit 240 a included incontroller 21 is applied through an ALU control line 232 a. To ALU units34 of ALU group 32 b, an ALU control signal from an ALU control circuit240 b included in controller 21 is applied through an ALU control line232 b.

ALU control circuits 240 a and 240 b are selectively activated inaccordance with an output signal of an instruction decoder decoding aninstruction in controller 21, and separately and individually generatethe control signals.

In the configuration shown in FIG. 90, in the group 32 of arithmeticlogic units 34, the contents of operation by ALU groups 32 a and 32 bcan be set independently, and hence more complicated arithmetic/logicoperation becomes possible.

Here, in memory cell mat 30, it is not particularly required that databits of the same address are operated in ALU groups 32 a and 32 b. Byway of example, data transfer and arithmetic/logic operation betweenmemory cell mat 30 a and ALU group 32 a, and data transfer andarithmetic/logic operation between memory cell mat 30 b and ALU group 32b are performed alternately. For example, when data is transferred withALU group 32 a, arithmetic/logic operation is executed in ALU group 32b, and when arithmetic/logic operation is executed in ALU group 32 a,data is transferred with ALU group 32 b. When access contention occursbecause of some problem related to an arithmetic/logic operation cyclenumber or others, an access arbitration circuit is provided incontroller 21, by which data access by one sub-memory cell mat iscompleted first and data access to the other memory cell mat is made inthe next cycle. In this manner, it becomes possible to executearithmetic operations in ALU groups 32 a and 32 b using data bits ofdifferent addresses.

Alternatively, one of sub-memory mats 30 a and 30 b may have priority ofaccess, and at the time of programming, whether there is an access ornot to the sub-memory mat having the priory may be monitored using aflag. By describing a process of accessing to the other sub-memory matin accordance with the result of monitoring, the problem of data accesscontention to the same address position between different memory submats can be avoided.

As described above, in accordance with Embodiment 15 of the presentinvention, the ALU circuit is divided into a plurality of groups, andfor each ALU group, the ALU control signal line is provided. Thus, itbecomes possible to execute different arithmetic/logic operations indifferent ALU groups, and hence, it becomes possible to execute acomplicated arithmetic/logic operation at high speed.

Embodiment 16

FIG. 91 schematically shows a configuration of the main portion of asemiconductor device in accordance with Embodiment 16 of the presentinvention. Referring to FIG. 91, basic operation blocks FB1 to FBn arecoupled, in parallel, to internal data bus 12 (global data bus GBS). Tothe global data bus GBS, a large capacity memory 250 is connected. Theglobal data bus GBS is coupled to an external system bus 5 through aninput/output circuit 10.

Large capacity memory 250 is, by way of example, a random access memory(RAM) having storage capacity sufficient to store data of one image, orstorage capacity of several to several tens M bits.

To large capacity memory 250, arithmetic/logic operation data is storedfrom an externally provided host CPU through input/output circuit 10.The manner of storing data in large capacity memory 250 will bedescribed in detail later. Basic operation blocks FB1 to FBn transferdata to and from large capacity memory 250 through global data bus GBS.The data line of global data bus GBS is implemented as interconnectionlines over the chip, and therefore, it may have a large bit width.Therefore, band width of data transfer between large capacity memory 250and any of basic operation blocks FB1 to FBn can be made large, wherebythe time necessary for the data transfer does not pose any bottle neckto the arithmetic/logic operation.

FIG. 92 schematically shows a data transfer path between large capacitymemory 250 and one basic operation block FBi. In main processingcircuitry 20, between memory cell mats 30A and 30B, a group 32 ofarithmetic logic units (ALU units) is provided. These memory cell mats30A and 30B can transfer data to and from large capacity memory 250,through global data bus GBS. In main processing circuitry 20, aninput/output circuit serving as an interface between memory cell mats30A, 30B and the large capacity memory 250 is provided, though not shownin FIG. 92.

When the bus width of global data bus GBS is the same as the number ofentries of memory cell mats 30A and 30B, data bits of one row of memorycell mats 30A and 30B can be transferred to and from large capacitymemory 250. In this case, the input/output data bits of large capacitymemory 250 may be the same as the bit width of one entry of memory cellmats 30A and 30B. Then, contents of one entry can be transferred in onedata transfer cycle (in this case, dual port memory cells are used inthe memory cell mats).

FIG. 93 shows an exemplary configuration of a portion performing datatransfer between large capacity memory 250 and one memory cell mat 30.Data access of large capacity memory 250 is controlled by a control CPU25 in the central control unit of FIG. 1. Data input/output of data ofmemory cell mat 30 is performed by controller included in thecorresponding basic operation block. Between control CPU 25 andcontroller 21, data transfer request REQ and data transferacknowledgement ACK are transferred, to effect data transfer.

By way of example, large capacity memory 250 has a 2-port configuration,data transfer is performed through input/output circuit 10 and a portEXP, and further, large capacity memory 250 performs data transfer toand from memory cell mat 30 through internal port INP. Therefore, dataEDT is stored through input/output circuit 10 and external port EXP, anddata block TRD aligned in the direction orthogonal thereto istransferred to memory cell mat 30 through the port INP. Memory cell mat30 has entries ERY0 to ERYm, and data blocks XRD of the same bitpositions of entries ERY0 to ERYm are transferred to and from largecapacity memory 250.

Therefore, when data is transferred between large capacity memory 250and memory mat 30, if the data blocks TRD and XRD are each memory celldata connected to one word line, it is possible to transfer the datablock TRD or XRD simply by selecting a word line once.

Data may be stored word by word to large capacity memory 250 from theoutside through the port EXP. Data block EDT corresponds to the wordline direction of the port EXP. Therefore, large capacity memory 250 hasdata transposing function. When the input/output circuit as theinterface of the external bus has the transposing function, largecapacity memory 250 need not have the data transposing function. In adual port configuration where the data transfer bus between input/outputcircuit 10 and large capacity memory 250 is separate from the datatransfer bus between the large capacity memory and the basic operationblock, data transfer between the large capacity memory and the outsidecan be performed parallel to the data transfer between the largecapacity memory and the functional block. In the dual portconfiguration, the bit width of the port INP corresponds to the entrynumber (m+1) of memory mat 30 or the bit width of the global data bus.

Large capacity memory 250, however, may be a single port memory. In thatcase, after data transfer from the outside to large capacity memory 250is finished, data transfer between large capacity memory 250 and thebasic operation block is performed. Further, in data transfer betweenlarge capacity memory 250 and basic operation blocks FB1 to FBn, whilean arithmetic/logic operation is executed in one basic operation block,data transfer may be performed between the large capacity memory andanother basic operation block, so that data transfer andarithmetic/logic operation may be executed in an interleaved manner orpipeline manner.

FIG. 94 schematically shows another manner of data transfer betweenlarge capacity memory 250 and memory cell mat 30. Referring to FIG. 94,large capacity memory 250 is a single port memory, and it is coupled toglobal data bus GBS. Memory cell mat 30 of main processing circuitry 20is a dual port memory, coupled to global data bus GBS through a port A,and coupled to global data bus GBS through a port B. Data transfer toand from large capacity memory 250 is performed in units of entries ERthrough port A. Port B is for data transfer to and from an external hostCPU through input/output circuit 10, using a specific bus of global databus GBS.

In the configuration shown in FIG. 94, when external data EDT are to bestored in a word-line by word-line basis in large capacity memory 250,the data EDT consisting of a plurality of words on the word line can betransferred through global data bus GBS to memory cell mat 30 throughport A, whereby the data of entry ERY can be collectively transferred tomemory mat 30.

The port B is used for direct data transfer to and from input/outputcircuit 10. In this case, input/output circuit 10 is not required to bethe same in bit width as global data bus GBS. Port B adjusts theinput/output bit width of input/output circuit 10 and the memory cellmat. When data is to be transferred using the port B, input/outputcircuit 10 is required to have a transposing circuit for transposing thedata positions.

In the configuration shown in FIG. 94, the memory cell mat of the mainprocessing circuitry has a 2-port configuration. However, when the portA is used for data transfer between large capacity memory 250 andinput/output circuit 10 and port B of the memory is used only for datatransfer to and from the ALU group 32, it is unnecessary to provide anyarrangement for transposing data outside the main processing circuitry20. The data for the external CPU can be stored through port A.

Further, data transfer between large capacity memory 250 and memory cellmat 30 in the configuration of FIG. 94 is performed, referring to aninternal address pointer (pointer register), using control CPU 25 andcontroller 21, as in the configuration shown in FIG. 93.

As described above, according to Embodiment 16 of the present invention,a large capacity memory is provided common to a plurality of basicoperation blocks, and through an internal data bus having a large bitwidth, data is transferred between a selected basic operation block andthe large capacity memory. Thus, the time required for data transfer canbe reduced, and high speed arithmetic/logic operation can be achieved.

Embodiment 17

FIG. 95 schematically shows a configuration of a main portion of asemiconductor processing device in accordance with Embodiment 17 of thepresent invention. In the semiconductor processing device shown in FIG.95, large capacity memory 250 coupled to the internal data bus (globaldata bus) GBS is divided into a plurality of banks BK0 to BKk. Each ofthe banks BK0 to BKk has a storage capacity comparable to the memorycell mat included in the basic operation blocks FB1 to FBn. Therefore,the storage capacity of large capacity memory 250 is (number ofbanks)×(capacity of memory mat).

FIG. 96 schematically represents connecting relation between largecapacity memory 250 and main processing circuitry 20 of one basicoperation block FBi. In main processing circuitry 20, coefficient datais stored in memory cell mat 30. In large capacity memory 250, imagedata is stored in each of banks BK0 to BKk, and data transfer to andfrom ALU unit 32 is performed through global data bus GBS. In this case,the bit width of global data bus GBS is the same as the number ofentries in the memory cell mat.

In image processing, multiplication between a coefficient andarithmetic/logic operation data is executed for filtering or the like.Here, the number of data of the object to be processed is far largerthan the number of coefficient data necessary for the arithmetic/logicoperation. Accordingly, coefficient data are stored in memory cell mat30 having a relatively small capacity, and the image data as the objectof processing are stored dispersed in banks BK0 to BKk of large capacitymemory 250.

At the time of arithmetic/logic operation, any of banks BK0 to BKk isselected in accordance with a bank select signal (not shown), and thedata of the selected bank are transmitted to the ALUs of the group ofarithmetic logic units 32. The processed image data are transferred tothe outside, and the new data are again stored in the correspondingbank. At the time of this data transfer to the outside, another bank isselected and parallel arithmetic/logic operation is executed in basicoperation block FBi.

FIG. 97 schematically shows a configuration of a semiconductorprocessing device according to Embodiment 17 of the present invention.In the configuration shown in FIG. 97, large capacity memory 250includes a port A circuit 252 a, a port B circuit 252 b, and a pluralityof banks BK0 to BKk. Internal data bus (global data bus) includes aninternal data bus GBSa coupled to input/output circuit 10, and a globaldata bus GBSb coupled to port B circuit 252 b of large capacity memory250 and to the group of arithmetic logic units 32 of main processingcircuitry 20. Global data bus GBSb has such a bit width that enablesparallel transfer of data bits to respective ALU units in the group 32of arithmetic logic units. The input/output circuit (not shown) of themain processing circuitry is coupled to internal data bus GBSa. Internaldata bus GBSa transfers program data to the micro instruction memory ofthe basic operation block and control information or the like to anothercontroller 21.

Access control of large capacity memory 250 is performed by a memorycontroller 255. Operation control of main processing circuitry 20 ismade by controller 21 in the basic operation block. Controller 21transfers load/store instruction to memory controller 255. Memorycontroller 255 and controller 21 individually and separately generateaddress pointers.

FIG. 98 is a timing chart representing an operation of the memoryarrangement shown in FIG. 97. As can be seen from FIG. 98, first, aninstruction is given from the external host CPU, and under the controlof controller 21, data are stored in memory mat 30. Thereafter, by theinstruction from external host CPU, memory controller 255 is activated,and under the control of host CPU, data to be processed are loaded froman external memory to banks BK0 to BKk through input/output circuit 10.Data load to large capacity memory 250 may be executed in the DMA modeunder the control of DMA4 shown in FIG. 1.

When data load to memory mat 30 and banks BK0 to BKk is finished,controller 21 initiates an arithmetic/logic operation. Thearithmetic/logic operation is performed on the data of memory cell mat30 and bank #0 (BK0), and the result of operation is stored in bank BK0.When processing of one bank is completed, the bank is switched to thenext one, and the data processing of banks #1, #2, . . . is executed.The processed data of bank #0 (BK0) is transferred to the externalmemory in DMA mode by DMA circuit 4 activated by controller 255 throughport A circuit 252 a, and new image data is stored in bank #0 (BK0).

Therefore, even if the process of storing data in one bank through portA circuit 252 a takes a relatively long time, what is required is thatthe data loading to bank #0 is completed before the time the process onthis bank is started after the end of arithmetic/logic operation onother bank. Thought the bit width of port A circuit 252 a is limited ascompared with the bit width of internal data bus GBSa, data transferbetween the external memory and large capacity memory 250 does not exertany undesirable influence on the arithmetic/logic operation on data inthe main processing circuitry, as internal data buses GBSa and GBSb areprovided separately.

Further, each of the banks BK0 to BKk of large capacity memory 250transfers data to and from the group of arithmetic logic units 32through global data bus GBSb, and necessary data can be transferred ineach operation cycle. Thus, high speed processing becomes possible.

As described above, according to Embodiment 17, the large capacitymemory is adapted to have a multi-bank configuration, and one bank isregarded as a memory cell mat of the main processing circuitry toexecute the arithmetic/logic operation. Thus, processed image data andnew image data can be transferred in a pipeline manner and high speedprocessing becomes possible.

In main processing circuitry 250, memory cell mat 30 may have a dualport configuration or a single port configuration (in single portconfiguration, however, write data to memory mat 30 is required to besubject to bit position changing process).

Embodiment 18

FIG. 99 schematically shows a configuration of a main portion of thesemiconductor processing device in accordance with Embodiment 18 of thepresent invention. Referring to FIG. 99, a plurality of basic operationblocks are connected in parallel, to internal data bus (global data bus)GBS. FIG. 99 shows main processing circuitry (20) MPA0 to MPA3 includedin the basic operation blocks as representative examples. Each of themain processing circuitries (20) MPA0 to MPA3 includes memory mats 30Aand 30B as well as an ALU group arranged between these memory mats 30Aand 30B. The ALU group is not shown in FIG. 99. For the ALU group,switch circuits (44) ECM for interconnecting ALUs are provided.

In the following description, the switches (44) for interconnecting ALUswill be denoted by “ECM”.

Memory cell mats 30A and 30B are each divided into a plurality ofentries ERY, and for each entry ERY, an inter-ALU connecting circuit(65) is provided.

As shown in FIG. 1, between basic operation units, inter-block data bus16 is provided for connecting neighboring blocks. Inter-block data bus16 includes a neighboring block entry interconnecting line 260 forinterconnecting inter-ALU connecting circuits (65 in FIG. 7) ofneighboring basic operation blocks. Interconnecting line 260interconnects entries at the same position of main processingcircuitries MPA of neighboring operation blocks.

Global data bus GBS is coupled to an external system bus 5 throughinput/output circuit 10.

FIG. 100 shows a specific manner of connection of neighboring blockentry interconnecting 260. Referring to FIG. 100, in basic operationblocks FBi and FB(i+1), the neighboring block entry interconnecting line260 is arranged extending along the bit line direction (direction ofentry extension), interconnecting ALU units ALUj provided for theentries ERYj of the same column. The neighboring block entryinterconnecting line 260 is arranged extending over the memory cell matsin the direction of extension of the entries, that is, the samedirection as the bit lines, and interconnects the unit ALU circuitblocks (ALU unit) ALUj of the same column of entries in the neighboringbasic operation blocks FBi and FB(i+1).

The global data bus shown in FIG. 99 is coupled to the correspondingsense amplifier group and the write driver group through input/outputcircuit (see FIG. 15) of each basic operation block. In each of mainprocessing circuitries MPA0 to MPA3, interconnection lines (internallines in the memory) connecting the sense amplifier group and the writedriver group to the input/output circuit are provided by interconnectionlines at an upper layer over the sense amplifier group or the writedriver group, or by lines at an upper interconnection layer over thememory cell mat, enabling parallel transfer of a plurality of bits ofdata.

In the example shown in FIG. 100, neighboring block entryinterconnecting line 260 connects ALUs to each other. The neighboringblock entry interconnecting line 260, however, is coupled to theinter-ALU connecting circuit 65 through the corresponding ALU unit ALUj.Therefore, neighboring block entry interconnecting line 260 may bedirectly connected to inter-ALU connecting circuit 65. Inter-ALUconnecting circuit 65 is coupled to the X-register or Z-register in theALU unit.

[First Modification]

FIG. 101 schematically shows an arrangement of inter-block data busaccording to a first modification of Embodiment 18. Referring to FIG.101, parallel to global data bus GBS, main processing circuitries MPA0to MPAk included in the basic operation blocks are coupled. In each ofthese main processing circuitries MPA0 to MPAk, inter-ALU connectingswitch circuit ECM is arranged between memory mats 30A and 30B. Byneighboring block entry interconnecting line 260, inter-ALU connectingcircuits (65) of the entries at the same position of neighboring mainprocessing circuitries in the inter-ALU connecting switch circuit ECMsare connected.

In the arrangement shown in FIG. 101, the ALU units and the inter-ALUconnecting circuits provided for the entries of the same position of themain processing circuitries MPA0 and MPAk in furthest basic operationblocks are interconnected by a feedback line 262. Thus, the ALU units ofthe entries at the same position in main processing circuitries MPA0 toMPAk are connected to each other in the form of a ring.

As the ALU units and the inter-ALU connecting circuits of the entries atthe same position in the basic operation blocks are interconnected in aring form, it becomes possible to transfer data to and from mainprocessing circuitries at any positions.

In FIG. 101, feedback line 262 is shown linearly extending over thememory cell mats of main processing circuitries MP0 to MPAk. Thefeedback line 262, however, may be arranged to form a feed back loopextending outside and around the main processing circuitries (memorymats).

FIG. 102 schematically shows another exemplary arrangement of thering-shaped data bus connecting neighboring blocks. Referring to FIG.102, on one side relative to global data bus GBS, main processingcircuitries MPA0 and MPA1 are arranged, and on the opposing siderelative to global data bus GBS, main processing circuitries MPA2 andMPA 3 are arranged. Main processing circuitries MPA0 and MPA1 placedadjacently on the same side of global data bus GBS have their ALU unitsinterconnected by a neighboring block entry interconnecting bus NBAa.The neighboring block entry interconnecting bus NBAa includesneighboring block entry interconnecting line 260 interconnecting the ALUunits and inter-ALU connecting circuits (65) provided for the entriesERY of the same position of neighboring main processing circuitries MPA0and MPA1.

In neighboring main processing circuitries MPA2 and MPA3 placedadjacently on the opposing side of global data bus GBS, a neighboringblock entry interconnecting bus NBAb is provided in the similar manner.The neighboring block entry interconnecting bus NBAb includesneighboring block entry interconnecting line 260 interconnecting the ALUunits and inter-ALU connecting circuits (65) provided for the entriesERY of the same position of neighboring main processing circuitries MPA2and MPA3.

The interconnecting buses for neighboring blocks (inter-block data bus16) are further interconnected, by neighboring block entryinterconnecting bus NBBa interconnecting the ALU units and inter-ALUconnecting circuits provided for the corresponding entries ERY of mainprocessing circuitries MPA0 and MPA2 at opposing positions with respectto global data bus GBS. The neighboring block entry interconnecting busNBBa includes a line 262 a interconnecting the ALU units and inter-ALUconnecting circuits provided for the entries ERY of the correspondingpositions of main processing circuitries MPA0 and MPA2.

Similarly, the ALU units and inter-ALU connecting circuits provided forthe entries ERY of the corresponding positions of main processingcircuitries MPA1 and MPA3 are interconnected by neighboring block entryinterconnecting bus NBBb. The neighboring block entry interconnectingbus NBBb includes a line 262 b arranged for each ALU unit and inter-ALUconnecting circuit.

Therefore, as shown in FIG. 102, even when the basic operation blocks(main processing circuitries MPA0 to MPA3) are arranged in a matrix ofrows and columns, the ALU units and the inter-ALU connecting circuits atopposing ends on one side relative to the global data bus areinterconnected to the ALU units and the inter-ALU connecting circuits ofbasic operation blocks (main processing circuitries) at opposing ends onthe other side relative to the global data bus, and therefore, the ALUunits of these main processing circuitries MPA0 to MPA3 can beinterconnected in a ring, enabling data transfer to and from any of themain processing circuitries.

Particularly, in neighboring block entry interconnecting buses NBBa andNBBb, lines 262 a and 262 b interconnect the ALU units and inter-ALUconnecting circuits provided for the entries ERY of the same positionsof main processing circuitries arranged opposing to each other.Therefore, interconnecting lines 262 a and 262 b come to have the samelength in respective buses NBBa and NBBb, so that signal propagationdelays are made the same, signal skew can be suppressed, and high speedtransfer becomes possible.

Neighboring block entry interconnecting buses NBBa and NBBb may beformed to have first interconnecting portions extending over memory cellmats 30A and 30B, respectively, and second interconnecting portionsextending in a direction orthogonal to the first interconnectingportions over the memory cell mats of the opposing main processingcircuitries with respect to the global data bus GBS. By interconnectingthe first and second interconnecting portions on the memory mats, theinterconnecting lines of memory mats opposing to each other with respectto the global data bus can be arranged in a compact manner, and increasein memory array area resulting from increased interconnection area canbe suppressed.

As described above, according to Embodiment 18 of the present invention,corresponding entries of the main processing circuitries of neighboringbasic operation blocks are interconnected by internal lines, andparticularly, interconnected in a ring. Therefore, data can betransferred at high speed between the main processing circuitrieswithout using the global data bus GBS.

FIG. 102 does not specifically show an internal structure of inter-ALUconnecting switch circuit ECM. Inter-ALU connecting switch circuit ECMincludes an ALU unit and an inter-ALU connecting circuit, and the ALUunits and inter-ALU connecting circuits are connected to each other bycorresponding interconnection line 260 or 262 a, 262 b.

Embodiment 19

FIG. 103 schematically shows the manner of connection of inter-ALUconnecting switch circuit (44) ECM according to Embodiment 19 of thepresent invention. In the example of FIG. 103, eight unit ALU circuitblocks (34) ALU0 to ALU7 are provided in one main processing circuitry.The unit ALU circuit block includes a processing circuit and variousregister circuits, and internal structure is determined appropriately inaccordance with the contents of operation to be achieved. The unit ALUcircuit block corresponds to the ALU unit (arithmetic logic unit) of theembodiments above. In the following, for simplicity of description, thearithmetic logic unit (ALU unit) will be denoted simply by “ALU”.

For these eight ALUs, inter-ALU connecting switch circuit ECM includes a1-bit shift area AR0 on which a switch circuit and lines for performing1-bit shift (move) between ALUs are arranged, a 2-bit shift area AR1 onwhich a switch circuit and lines for performing 2-bit shift arearranged, and a 4-bit shift area AR2 on which a switch circuit and linesfor performing 4-bit shift are arranged. In these shift areas AR0, AR1and AR2 in one basic operation block, the data are transferred betweenALUs at positions corresponding to 1-bit, 2-bit or 4-bit shift along thelongitudinal direction of the figure. As the data transfer (shift) bythe number of bits corresponding to the power of 2 is implemented, itbecomes possible to perform data transfer between any ALUs in 2 cycles.

It is necessary, however, to provide interconnection areas for therespective data shifts. When data shift between ALUs up to 2^(n) bits isto be done, interconnection area of (n+1) in total are necessary, from1-bit shift area to 2^(n)-bit shift area.

FIG. 104 shows an exemplary structure of an inter-ALU connecting circuitprovided in shift areas AR0 to AR2. The inter-ALU connecting circuitshown in FIG. 104 is provided for each ALU. The inter-ALU connectingcircuit shown in FIG. 104 corresponds to the inter-ALU connectingcircuit 65 shown in FIG. 7.

Referring to FIG. 104, inter-ALU connecting circuit (65) includes atransmitting/receiving register 270 selectively activated in accordancewith an up-shift designating signal UP and a down-shift designatingsignal DW, and transfer gates 272 and 273 selectively renderedconductive in accordance with a k-bit shift designating signal Enk, forconnecting transmitting/receiving register 270 to the inter-ALUconnecting circuit apart by k-bits. By the activation of k-bit transferdesignating signal Enk, data shift of 2^(k) bits is achieved (k=0, 1, .. . ).

Direction of data transmission and reception of transmitting/receivingregister 270 is determined by the shift designating signals UP and DW(connection of transmission register and reception register isdetermined). Transmission/reception register 270 is arranged common toall k-bit shift switches (transfer gates) 272 and 273 of thecorresponding inter-ALU connecting circuit.

As shown in FIG. 104, by the provision of transmitting/receivingregister 270, it becomes possible to transfer data bits between ALUsbi-directionally. Transmitting/receiving register 270 is connected tothe X-register of the corresponding ALU (in the arrangement of FIG. 7).When the X-register and Z-register exist in the ALU and the X-registeris used as the receiving register and the Z register is used as thetransmitting register (see FIG. 49), transmitting/receiving register 270may not be provided.

In the arrangement shown in FIG. 103, in 1-bit shift area AR0, ALU0 toALU7 are connected to each other (by means of switch circuits).Consequently, it becomes possible to transfer data bits bi-directionallyin a ring form, in the same main processing circuitry block.

[First Modification]

FIG. 105 schematically shows an arrangement of a first modification ofEmbodiment 19 of the present invention. Referring to FIG. 105, inter-ALUconnecting switch circuit ECM includes a 1-bit shift area AR0 for 1-bitshift between ALUs, and a 2/4-bit shift area AR3 on which lines/switchcircuits for performing 2-bit/4-bit shift are arranged. In 1-bit shiftarea AR0, data transfer between neighboring ALUs is possible, similar tothe arrangement of FIG. 103.

In 2/4-bit shift area AR3, a programmable switch circuit PSWalternatively provides a 2-bit shift operation or a 4-bit shiftoperation. In the arrangement shown in FIG. 105, in order to switchbetween the 2-bit shift and 4-bit shift, a programmable switch PSW isrequired. However, the number of bus lines for transfer (move) can bereduced, and the area occupied by the buses can be reduced.

The programmable switch circuit PSW shown in FIG. 105 is arrangedbetween each of the lines in 2-bit shift area AR1 of FIG. 103.

FIG. 106 schematically shows an exemplary structure of programmableswitch PSW. Referring to FIG. 106, programmable switch PSW includes atransfer gate 280 selectively disconnecting lines 275 a and 275 b inaccordance with an enable signal Ena, a transfer gate 281 selectivelyconnecting line 275 a to one node of transmitting/receiving register 270in accordance with an enable signal ENb, and a transfer gate 282connecting line 275 b to the other node of transmitting/receivingregister 270 in accordance with an enable signal ENc. Thetransmitting/receiving register 270 and the programmable switch PSW formthe inter-ALU connecting circuit (65).

Transmitting/receiving register 270 includes a transmitting register anda receiving register, and performs upward shift along an upward arrowand performs downward data transfer along a downward arrow.Transmitting/receiving register 270 is coupled, for example, to theX-register included in the corresponding ALU.

By selectively setting the transfer gates 280 to 282 to theconductive/non-conductive state in the programmable switch circuit PSWshown in FIG. 106, 2-bit shift or 4-bit shift can be achievedselectively, and data can be transferred bi-directionally, that is,upward and downward.

Switch control signals ENa to ENc are included in the ALU controlsignals generated, based on the result of decoding of the program, fromcontroller 21.

FIG. 107 schematically shows an interrupted state, which is one of theconnection states of programmable switch circuit PSW. Referring to FIG.107, in the interrupted state of programmable switch PSW, transfer gates281 and 282 are rendered conductive, and transfer gate 280 is renderednon-conductive. Here, connection lines 275 a and 275 b are disconnectedby transfer gate 280, and data is transferred through the correspondinginter-ALU connecting circuit (65). The direction of data transfer isdetermined by the state of connection of the transmitting and receivingregisters.

FIG. 108 schematically shows a through connection state, which isanother one of the connection states of programmable switch circuit PSW.In the through state THR, transfer gate 270 is set to the conductivestate, and transfer gates 281 and 282 are set non-conductive. Therefore,lines 275 a and 275 b are interconnected, and disconnected from thecorresponding ALU unit. Thus, in the through state THR, the data bits onconnection lines 275 a and 275 b are transferred through thecorresponding ALU to another ALU. By this through arrangement, data canbe transferred through the ALU unit apart by 2 bits to the ALU unitapart by 4 bits, in 4-bit transfer mode.

FIG. 109 schematically shows a disconnection/dummy state IRD, which isother one of the connection states of programmable switch circuit PSW.In the interruption/dummy state IRD, transfer gates 280 and 282 are setto the non-conductive state, and transfer gate 282 is set to theconductive state. Therefore, connection line 275 b is connected to thecorresponding ALU, while connection line 275 a is isolated from thecorresponding ALU. Connection line 275 b transfers data bits to/from thecorresponding ALU, while connection line 275 a does not contribute todata transfer and arranged as a dummy line.

FIG. 110 shows an example of connection of programmable switch PSW in2-bit/4-bit shift area AR3. Referring to FIG. 110, a switch circuit PSWais set to the interrupted state ITP, and a switch circuit PSWb is set tothe through state THR. Therefore, data transfer is performed between ALU(ALU unit) 0, ALU2, ALU4 and ALU 6 by programmable switch circuits PSWaand PSWc, and data transfer is performed between ALU1, ALU3, ALU5 andALU7 by programmable switch circuit PSWa in the interrupting state.Similarly, by the programmable switch circuit PSWb in the through state,data transfer is performed between ALU 6 and ALU0 and between ALU1 andALU 7. By such connection of switches, 2-bit shift operation is achievedamong ALU0 to ALU7.

In ALU6, switch circuit PSWc is set to the interrupting/dummy state.ALU6 is connected to ALU 0 through programmable switch PSWb. Therefore,programmable switch PSWc provided for ALU6 is not required to transferdata further downward, and has the connection line on one side thereofset always in the dummy connection state. Therefore, programmable switchPSWc provided for ALU6 may have transfer gates 280 and 282 shown in FIG.108 always set to the non-conductive state. Alternatively, switchcircuit PSWc for ALU6 may be formed simply by transfer gate 281 shown inFIG. 109.

FIG. 111 shows an example of a connection of the programmable switchcircuits in the 4-bit shift (move) operation. Referring to FIG. 111,programmable switch circuit PSWa is set to the interrupted state ITP,programmable switch circuit PSWb is set to the through state, andprogrammable switch circuit PSWc is set to the interrupting/dummy stateIRD.

In the state of connection shown in FIG. 111, ALU0 is coupled to ALU4,and ALU4 is separated from ALU6 and connected to ALU2 by programmableswitch PSWc in the through state THR. ALU2 is disconnected from ALU0 byprogrammable switch circuit PSWc in the interrupting/dummy state.

ALU6 is coupled to ALU1 through switch circuit PSWc in theinterrupting/dummy state, and ALU7 is coupled to ALU3. ALU3 is separatedfrom ALU1 by programmable switch circuit PSWc.

Therefore, by setting the programmable switch circuits PSW to any of thestates ITP, THR and IRD in shift area AR3, 2-bit shift operation and4-bit shift operation can be achieved. Therefore, it becomes unnecessaryto separately provide the interconnection lines for 2-bit shift and4-bit shift, and the area occupied by connection lines can be reduced.

[Second Modification]

In order to mitigate the pitch condition of lines in shift areas AR0 toAR2 or AR3 (restriction on arrangement of switch circuits PSW), thearrangement of ALUs is made as shown in FIG. 112.

In FIG. 112, four unit ALU circuit blocks (ALUs) are arranged aligned inthe entry extending direction. Sense amplifiers/write drivers (dataregisters) DRG0 a to DRG7 a on memory cell mats on one side and senseamplifiers/write drivers (data registers) DRG0 b to DRG7 b on memorycell mats on the other side are arranged corresponding to the respectiveentries (not shown).

As shown in FIG. 112, the ALU pitch of the unit ALU circuit block(hereinafter simply referred to as ALU) is determined so as tocorrespond to the pitch for arranging four entries (senseamplifiers/write drivers DRGs) per one memory cell mat. Thus, the pitchof the signal lines for shifting among ALUs can be mitigated among ALUs,and therefore, a large number of shifting interconnection lines can bearranged with sufficient margin for the respective ALUs.

FIG. 113 schematically shows a line layout of inter-ALU connectingswitch circuits corresponding to the ALU arrangement shown in FIG. 112.In FIG. 113, ALUs arranged in four rows and five columns will be denotedby “X[0] to X[19]”. Typically, when data bits are transferred betweenALUs, data bits are transferred using the X-registers. Therefore, anexample of inter-ALU connection in which X-registers included inrespective ALUs are connected will be described.

Connection of ALUs neighboring to each other in the Y direction (entryextending direction) in the figure is achieved by connection line 290 aconnecting X[i] and X[i+1]. The rightmost ALU among the ALUs aligned inthe Y direction, that is, X[i+3] is connected to the ALU unit on theleft side of the next, neighboring column, that is, X[4 i+1]. Byconnection lines 290 a and 290 b, ALU units arranged in four rows andfive columns are successively connected, to implement the 1-bit shiftoperation.

ALUs neighboring in the X direction are connected to each other by line292 (switch circuit is not shown). By the line 292, ALU(X[i]) is coupledto ALU([Xi+4]) apart by 4 bits, and thus, the 4-bit shift operation canbe implemented by line 292.

Line 296 supports a shifting between further apart ALUs, and by the line296, 32-bit or 64-bit shift, for example, can be supported.

When one main processing circuitry has 256 entries, ALUs are connectedto the corresponding ALUs of the neighboring main processing circuitrythrough inter-block data bus NBS (bus 16 of FIG. 1), so that a 256 bitshift is implemented.

FIG. 114 schematically shows an exemplary arrangement of inter-blockdata bus NBS (bus 16 of FIG. 1). By way of example, in memory cell mat30, 256 entries are provided. In the group 32L of ALU units in basicoperation block FBi, four ALUs are arranged aligned in each row.Therefore, in the group 32L of ALU units, ALU0 to ALU255 (X[0]-X[255])are arranged.

In basic operation block FB(i+1), similarly, ALUs are arrangedcorresponding to 256 entries with four ALUs placed in alignment in therow direction. Basic operation blocks FBi and FBi+1 have successiveaddress areas (address areas of external CPU), and 256 ALUs in ALU unitgroup 32R are allotted with serially successive numbers. Thus, ALUs(X[256]-X[511]) are arranged.

ALUs arranged at the same position of ALU unit groups 32L and 32R areconnected to each other by neighboring inter-block data line 290 ofinter-block data bus NBS By way of example, ALU(X[3]) is connected toALU(X[259]) of ALU unit group 32R. Similarly, ALU(X[255]) of ALU unitgroup 32L is connected to ALU(X[511]) of ALU unit group 32R. Thus, bytransferring data bits through the inter-block data bus NBS, a 256-bitshift operation can be achieved.

Each ALU in ALU unit group 32L of basic operation block FBi is furtherconnected to the ALU in the main processing circuitry of another,neighboring basic operation block, through inter-block data bus NBS.

By arranging the ALUs hierarchically using eight ALUs as a unit in thearrangement of ALUs shown in FIG. 113, and using switch circuits orprogrammable switch circuits (see FIG. 105) for connection of lines, itbecomes possible to achieve 1-bit to 2^(n) bit shift operations.

[Third Modification]

FIG. 115 schematically shows an arrangement according to the thirdmodification of Embodiment 19 of the present invention. In thearrangement shown in FIG. 115, for controlling the connection ofinter-ALU connecting switch circuit ECM, an ALU shift control circuit300 is provided. ALU shift control circuit 300 individually controlsconnection of inter-ALU connecting switch circuits ECM0 to ECM3 includedin main processing circuitries MPA0 to MPA3. Therefore, arithmetic/logicoperation can be done with the amount of shift between ALUs in mainprocessing circuitries MPA0 to MPA3 made different from each other.

The shift control by ALU shift control circuit 300 may be executed underthe control of controller 21 included in basic operation block FB shownin FIG. 1. Further, ALU shift control circuit 300 may be arrangeddistributed in the controller of each basic operation block, to controlthe connection of the inter-ALU connecting switch circuit of thecorresponding ALU. Alternatively, ALU shift control circuit 300 may beconfigured to set the amount of shift in each of the inter-ALUconnecting switch circuits ECM0 to ECM3 under the control of an externalhost CPU through system bus 5.

[Fourth Modification]

FIG. 116 schematically shows an arrangement of a fourth modification ofEmbodiment 19 of the present invention. In the arrangement shown in FIG.116, in each of main processing circuitries MPA0 to MPA3, inter-ALUconnecting switch circuit ECM is divided into an upper switch circuitECMU and a lower switch circuit ECMD. In order to individually controlthe upper switch circuit ECMU and lower switch circuit ECMD by mainprocessing circuitries MPA0 to MPA3, ALU shift control circuit 300applies control signals (denoted by U and D) individually to the upperswitch circuit and lower switch circuit of main processing circuitriesMPA0 to MPA3. The control signal denoted by character U controlsconnection of the upper switch circuit ECMU, and the control signaldenoted by character D controls connection of the lower switch circuitECMD.

Except for this point, the arrangement shown in FIG. 116 is the same asthat of FIG. 115. Therefore, corresponding portions are denoted by thesame reference characters and description thereof will not be repeated.

In the arrangement shown in FIG. 116, in each of main processingcircuitries MPA0 to MPA3, the amount of bits to be shifted between ALUscan be set individually by the upper switch circuit ECMU and lowerswitch circuit ECMD. Therefore, by way of example, an 8-bit shiftoperation is executed in the ALU corresponding to the upper switchcircuit ECMU and a 2-bit shift operation is executed in the ALUcorresponding to the lower switch circuit ECMD, and thus, differentarithmetic operations can be performed in parallel.

As in the third modification, the ALU shift control operation of ALUshift control circuit 310 may be effected by the controller (21)included in main processing circuitries MPA0 to MPA3. Alternatively, ALUshift control circuit 310 may be provided dedicatedly only forcontrolling the inter-ALU shift operation.

In the arrangement shown in FIG. 116, the inter-ALU connecting switchcircuit is divided into two switch circuits in each of main processingcircuitries MPA0 to MPA3. The number of division of the inter-ALUconnecting switch circuits is not limited to two, and these switchcircuits may be divided into a greater number of blocks. By ALU shiftcontrol circuit 310, the amount of shift is controlled in each block.

In the arrangement shown in FIG. 116, in each of the main processingcircuitries, the amount of shift among a plurality of ALUs can be setindividually, and therefore, each of the main processing circuitries canexecute different arithmetic operation. Consequently, more complicatedarithmetic/logic operation can be supported.

[Fifth Modification]

FIG. 117 shows a modification of the inter-ALU connecting circuit.Referring to FIG. 117, as lines 275 a and 275 b shown in FIG. 7, +1 bitshift line 320 au, +4 bit shift line 320 bu, +16 bit shift line 320 cuand N bus shift line 320 du, −1 bit shift line 320 ad, −4 bit shift line320 bd, −16 bit shift line 320 cd and −N bus shift line 320 dd areprovided. N bus shift lines 320 du and 320 dd are the lines ofinter-block data bus NBS.

The inter-ALU connecting circuit further includes a multiplexer (MUX)315 u selecting one of signal lines 320 au-320 du in accordance with ashift command signal, a multiplexer (MUX) 315 d similarly selecting oneof signal lines 320 ad-320 dd in accordance with the shift commandsignal, and a transmitting/receiving data register 317 transmitting andreceiving data bi-directionally between the signal lines selected bymultiplexers 315 u and 315 d and the corresponding ALU unit 319.

To transmitting/receiving data register 317, a transfer directiondesignating signal U/D designating a + shift/− shift is applied.

The shift command signals including the transfer direction designatingsignal may be generated as ALU control signals from the controller ofthe corresponding basic operation block FB, or may be generated fromshift control circuit 300 or 310 according to the third or fourthmodification above.

Transmitting/receiving data register 317 corresponds totransmitting/receiving data register 270 shown in FIGS. 104 and 106.

Multiplexers 315 u and 315 d may be used as the programmable switchcircuits PSWs shown in FIG. 105. By controlling connection ofmultiplexers 315 u and 315 d, the through state, interrupting state andthe dummy state of the programmable switch circuits PSWs shown in FIGS.105 to 111 may be implemented.

FIG. 118 shows an exemplary structure of transmitting/receiving dataregister 317 shown in FIG. 117. In the corresponding ALU unit 319, anX-register 320 is shown as a representative register circuit performingthe data transfer between ALUs. Other register, such as the XH-register,XL-register or Z-register, may be used for data transfer between ALUs.

Transmitting/receiving data register 317 includes a transmittingregister 325 receiving a data bit from an output OUT of X-register 320,a receiving register 326 taking in the received data for transmission tothe input IN of X-register 320, and a path setting circuit 330connecting transmitting register 325 and receiving register 326selectively to a plus (+) direction shift line 320 u and a minus (−)direction shift line 320 d.

Plus direction shift line 320 u includes shift lines 320 au-320 du shownin FIG. 117, and minus direction shift line 320 d includes shift lines320 ad-320 dd shown in FIG. 117. In the arrangement shown in FIG. 118,multiplexers 315 u and 315 d of FIG. 117 are not shown.

In the arrangement shown in FIG. 118, when a data bit is to betransferred in the plus (+) direction, path setting circuit 330 couplestransmitting register 325 to plus direction shift line 320 u, andcouples receiving register 326 to minus direction shift line 320 d. Thedata of transmitting register 325 is transferred to the ALU in theupward direction, and stored in the receiving register of thecorresponding destination. Receiving register 326 stores datatransferred from the transmitting register of the lower ALU.

When data transfer in minus direction is to be performed, path settingcircuit 330 connects transmitting register 325 to minus direction shiftline 320 d, and connects receiving register 326 to plus direction shiftline 320 u. Transmitting register 325 transfers data to the receivingregister of the lower side, destination ALU, and receiving register 326receives data transmitted from the upper side, source ALU.

In this manner, no matter whether the data bit shift (transfer) isperformed in the minus direction or plus direction, datatransmission/reception is possible. Transmitting register 325 andreceiving register 326 are used as transmitting/receiving register 270in the arrangement of inter-ALU connecting circuit shown in FIG. 104.

Further, path setting circuit 330 may be formed by a switch matrix forswitching the connections using switch circuits. Alternatively, in pathsetting circuit 330, two sets of transmitting tri-state buffer and areceiving tri-state buffer may be provided for different directions ofdata transfer, and the data transfer direction may be set by selectivelyactivating the set of tri-state buffers.

[Sixth Modification]

FIG. 119 schematically shows an arrangement of the sixth modification ofEmbodiment 19 of the present invention. In the arrangement shown in FIG.119, inter-ALU connecting lines include lines 340 extending in the Ydirection (entry extension direction) over memory cell mat 30, and lines342 extending in the X direction over memory cell mat 30 andinterconnecting lines 340 apart by a prescribed number of bits from eachother.

In ALU unit group 32, when four ALUs are arranged aligned in one columnas shown in FIG. 112 above (when ALU pitch is four times the bit linepitch), interconnection of lines 340 apart from each other by 4 bitsmakes a 64-bit transfer path. In place of the arrangement having linesextending over a long distance in ALU unit group 32, the lines for longdistance data transfer are arranged over memory cell mat 30, andtherefore, interconnection layout is facilitated.

Lines 340 and 342 arranged extending over memory cell mat 30 may be thelines interconnecting ALUs apart by 128 bits.

In the arrangement of inter-ALU connecting switch circuit, bit shiftamount of 2^(n)(n=0 . . . 8) has been described as examples. However, ashift line connection may be used to achieve appropriate amount ofshift, dependent on the contents of arithmetic/logic operation to beexecuted, the amount of bits to be shifted and the number of clockcycles necessary for the shift, or the number of entries included inmemory cell mat 30.

As described above, according to Embodiment 19 of the present invention,connection path among ALUs in the main processing circuitry is setindividually in each main processing circuitry, and the connection pathcan be set in a programmable manner. Therefore, inter-ALU connection canbe made efficiently without increasing the area occupied by the linesfor interconnecting ALUs, and the parallel operation performance can beimproved without increasing the interconnection layout area.

Embodiment 20

FIG. 120 schematically shows a structure of input/output circuit 10 inaccordance with Embodiment 20 of the present invention. Input/outputcircuit 10 is coupled to the host CPU through system bus 5, as shown inFIG. 1. Internal data bus 16 (global data bus GBS) is coupled commonlyto a plurality of internal basic operation blocks.

Input/output circuit 10 includes: an orthogonal transformation circuit400 for performing data transfer between j-bit host system bus (buslines HBS[(j−1):0]) and internal k-bit first internal transfer busCBS[(k−1):0] and performing orthogonal transformation of data bitarrangement, a cross bar switch 402 selectively setting a data transferpath between k-bit first internal transfer bus CBS[(k−1):0] and an m-bitsecond internal transfer bus SBS [(m−1):0] for performing data bittransfer, and a selector 404 transferring data between the secondinternal transfer bus SBS [(m−1):0] and an n-bit internal data bus(global data bus GBS [(n−1):0]).

Host system bus 5 is formed by a single-end bus line, while the firstand second transfer buses CBS and SBS as well as global data bus GBS(internal data bus 16) are formed by double-end bus lines, fortransmitting complemental signals. In the following, except the casewhen each bit on these lines is particularly referred to, the buses willbe referred to by characters CBS, SBS, GBS and HBS.

In input/output circuit 10, transformation of data arrangement andtransformation of data bit width for transfer are performed between thedata transferred in a j-bit word-serial and bit parallel manner and aword-parallel and bit serial data transmitted on n-bit global data busGBS.

FIG. 121 schematically shows a construction of an output portion fortransferring data from the first transfer bus CBS of orthogonaltransformation circuit 400 shown in FIG. 120 to host system bus HBS (bus5). In FIG. 121, a data output portion of orthogonal transformationcircuit 400 includes transformation elements TXF00 to TXF(k−1)(j−1)arranged in k rows and j columns. As transformation elements TXF00 toTXF(k−1)(j−1) are of the same configuration, FIG. 121 shows theconfiguration of transformation element TXF00 as a representativeexample. Transformation element TXF00 includes a flip-flop FFa taking inand latching signals on complementary internal data bus lines CBS[0] and/CBS[0] in accordance with a control signal SDoi[0] applied to a clockinput, and a tri-state buffer BF transmitting an output signal offlip-flop FFa to the single end system bus line HBS[0] in accordancewith an output control signal SToo[0].

First internal transfer bus lines CBS[u] and /CBS[u] are providedcorresponding to each row of transfer elements TXFs (generallyrepresenting the transfer elements), and a host system bus line HBS[v]is provided corresponding to each column of the transformation elements.Here, u=0 to (k−1) and v=0 to (j−1).

To the output buffer BF of transformation elements TXFs aligned in therow direction, an output control signal SToo[u] is commonly applied. Tothe clock inputs of flip-flops FFa of transformation elements aligned inthe column direction, an input control signal SDoi[v] is commonlyapplied.

The control signals SDo[(j−1):0] and SToo[(k−1):0] may be generated bycontrol CPU (25) shown in FIG. 1 under the control of host CPU, orsimilarly generated by CPU 25 in accordance with a DMA transfer requestfrom the controller provided in each basic operation block. Thesesignals may be directly generated by host CPU, and for DMA modetransfer, the signals may be generated under the control of the externalDMA controller.

FIG. 122 schematically shows an operation of the output portion oforthogonal transformation circuit 400 shown in FIG. 121. Data aretransferred in bit-serial and word parallel manner from the firstinternal transfer bus CBS. It is now assumed that data bits A[a], B[a],. . . G[a] are applied in parallel. Here, in accordance with an inputcontrol signal Doi(a), the transformation elements TXFs of the a-thcolumn take in and latch the applied data bits. Therefore, whenorthogonal transformation circuit 400 is fully filled with data from thefirst internal transfer bus CBS, data of the same bit position of wordsA, B, . . . G are arranged along the column direction and the bits ofeach word are arranged aligned in the row direction.

At the time of data output, transformation elements TXFs aligned in therow direction are simultaneously set to an output state in accordancewith the output control signal SD00[b]. Therefore, to the host systembus HBS, the bits [0] to [j−1] of one data word are output in parallel.Consequently, when bits of the same position of the entries are reachedfrom the first internal transfer bus CBS, it follows that each data wordis output serially to the host system bus HBS.

FIG. 123 shows an exemplary configuration of transformation element TXF.Referring to FIG. 123, flip-flop FFa includes: transfer gates 421 a and421 b transmitting signals on transfer bus lines CBS[s] and /CBS[s] inaccordance with the input control signal SDoi[u]; a cross-coupleddifferential amplifying circuit 422 for differentially amplifying, whenactivated, data transferred from transfer gates 421 a and 421 b; aP-channel MOS transistor 423 p supplying power supply voltage to aP-channel MOS transistors of cross-coupled type differential amplifyingcircuit 422 in accordance with the input control signal SDoi[u]; and anN-channel MOS transistor 423 n coupling an N-channel MOS transistors ofcross-coupled type differential amplifying circuit 422 to a ground nodein accordance with an inverted signal ZSDoi[u] of the input controlsignal SDoi[u].

Flip-flop FFa transmits, when the input control signal SDoi[u] is at theH level, the signals on the corresponding transfer bus lines CBS[s] and/CBS[s] to cross-coupled type differential amplifying circuit 422. Whenthe input control signal SDoi[u] is inactivated to attain L level,cross-coupled type differential amplifying circuit 422 is activated byMOS transistors 423 p and 423 n, to differentially amplify and latch thedata transferred by transfer gates 421 a and 421 b.

Tri-state buffer BF includes: a P-channel MOS transistor PX1 coupled toa power supply node and receiving at its gate an output Q of flip-flopFFa through an inverter; an N-channel MOS transistor NX1 coupled to aground node and receiving at its gate an output/Q of flip-flop FFa; anN-channel MOS transistor NX2 coupling MOS transistor NX1 to thecorresponding host system bus line HBS[t] in accordance with the outputcontrol signal SDoo[v]; and a p-channel MOS transistor PX2 coupling MOStransistor PX1 to the corresponding host system bus line HBS[t] inresponse to the output control signal SDoo[v] passed through aninverter.

Tri-state buffer BF shown in FIG. 123 is in the output high-impedancestate when the output control signal SDoo[v] is at the L level, as MOStransistors PX2 and NX2 are both off.

When the output control signal SDoo[v] attains to the “H” level, MOStransistors PX2 and NX2 are turned on, MOS transistors PX1 and NX1 arecoupled to the corresponding host system bus line HBS[t], and inaccordance with the output signals Q and /Q of flip-flop FF, the hostsystem bus line HBS[t] is driven.

The configuration of transformation circuit RXF shown in FIG. 123 is amere example, and different configuration may be employed. Any circuitconfiguration may be used provided that complementary signals are takenin and latched in accordance with the input control signal SDoi[u] andwhen the output control signal SDoo[v] is activated, a single end systembus line is driven in accordance with the taken complementary signals.

FIG. 124 schematically shows a construction of a data input portion oforthogonal transformation circuit 400 of FIG. 120. FIG. 124 shows aconstruction of an input portion receiving 1 word of data transmittedthrough the host system bus HBS. The construction of the input portionshown in FIG. 124 is expanded in accordance with the bit width (j bits)of the host system bus, and the construction shown in FIG. 124 isarranged repeatedly in accordance with the bit width (k bits) of thefirst internal transfer bus CBS.

Referring to FIG. 124, the input portion of orthogonal transformationcircuit 400 includes input transformation elements TXFI0 to TXFI7provided for bus lines HBS[0] to HBS[7] of host system bus HBS, and aword mask control circuit 430 masking outputs of these inputtransformation elements TXFI0 to TXFI7 in accordance with a mask signalline HBSm[0] instructing masking of data word by word.

Each of the input transformation elements TXFI0 to TXFI7 includes: aflip-flop FFb taking in a signal on the corresponding one of host systembus lines HBS[0] to HBS[7] in accordance with an input control signalSDii[x]; a tri-state buffer 432 transmitting, when activated,complementary signals to transfer bus lines CBS[x] and /CBS[x] inaccordance with the signal latched by the corresponding flip-flop FFb;and an AND circuit 431 receiving the mask control signal from word maskcontrol circuit 430 and the corresponding output control signal SDio[a]and activating the corresponding tri-state buffer 432. Here, in outputcontrol signal SDio[a], the indicator, a, assumes any of 0-7.

Word mask control circuit 430 includes: a flip-flop FFc reset inresponse to a reset signal SDir[x] for masking outputs of inputtransformation elements TXFI0 to TXFI7 of corresponding one word (8bits); and an NOR gate 433 receiving the output signal of flip-flop FFcand a signal on mask signal line HBSm[0]. Flip-flop FFc takes in andlatches the output signal of NOR gate 433 in accordance with the inputcontrol signal SDii[x]. The operation of the input portion of orthogonaltransformation circuit 400 shown in FIG. 124 will be described in thefollowing.

When data is transferred from the host system bus HBS, first, the resetsignal SDir[x] is activated, and flip-flop FFc of word mask controlcircuit 430 is reset. Consequently, in each of input transformationelements TXFI0 to TXFI7, AND gate 431 is disabled, and the inputtransformation elements are set to the output high-impedance state.

In accordance with the input control signal SDii[x] and the mask signalline HBSm of the host system bus, data bits on host system bus linesHBS[0] to HBS[7] are selectively taken into respective flip-flops FFB ofinput transformation elements TXFI0 to TXFI7. When the signal on masksignal line HBSm[0] is at the H level, the output signal of NOR gate 433of word mask control circuit 430 attains to the “H” level, and flip-flopFFc takes and latches the H-level signal in accordance with the inputcontrol signal SDii[x]. In accordance with the H-level output offlip-flop FFc, AND gate 431 of each of input transformation elementsTXFI0 to TXFI7 is enabled. In this state, in accordance with the inputcontrol signal SDii[x], flip-flops FFb in input transformation elementsTXFI0 to TXFI7 take in and latch the signals on host system bus linesHBS[0] to HBS[7].

When the mask signal HBSm[0] is at the L level, the output signal offlip-flop FFc of word mask control signal is at the L level, and in eachof input transformation elements TXFI0 to TXFI7, AND gate 431 ismaintained in the disabled state. In this state also, taking of datasignals on the corresponding host system bus lines is executed by theflip-flops FFb. At the time of outputting the latched data bits, outputcontrol signals SDio[0] to SDio[7] are activated successively. When theoutput signal of word mask control circuit 430 is at the L level, theoutput signals of these AND gates 431 are at the L level, and therefore,even when the corresponding output control signals SDio[0] to SDio[7]are activated to the H level, tri-state buffer 432 is in the outputhigh-impedance state. Therefore, in this case, data bits are nottransferred from input transformation elements TXFI0 to TXFI7, and theword from the CPU is masked.

When the output signal of word mask control circuit 430 is at the Hlevel, AND gates 431 are activated in accordance with output controlsignals SDio[0] to SDio[7], respectively, and tri-state buffer 432drives complementary transfer buses /CBS[x] and CBS[x] in accordancewith the signals latched in the corresponding flip-flops FFb.

FIG. 125 schematically represents a data transfer operation at the inputportion of orthogonal transformation circuit 400 of FIG. 124. Inorthogonal transformation circuit 400, when data is input, the data onhost system bus HBS is taken in and latched in accordance with the inputcontrol signal SDii[x]. The data on host system bus HBS are selectivelymasked for each word in accordance with mask data m[0] to m[(j−8)/8].When the input control signal SDii[j−1] is activated eventually, thestorage area of the input portion of orthogonal transformation circuit400 is full.

At the time of data output, in accordance with output control signalSDio[v], data aligned in one column along the longitudinal directionrepresented by the hatched area in the figure are transferred, inparallel, to the first internal transfer bus CBS. When there are maskdata MSDT of which masking has been instructed by the mask signal HSBM,the data are not transferred to the corresponding transfer bus CBS[k−1],and the mask data MSDT are masked.

By this configuration of the input portion, it becomes possible to mask,in a word unit, the data from the host CPU for storage in the memorycell mat in the main processing circuitry of the internal basicoperation block.

The control signal SDii[x], reset signal SDir[x] and output controlsignal SDio[v] may be generated by an external host CPU or by centralcontrol unit 15 shown in FIG. 1 at the time of data input, or thesecontrol signals may be successively activated by a dedicated countercircuit (shift register).

When two sets of the output portion shown in FIG. 121 and the inputportion shown in FIG. 124 are provided and the input/output portions areoperated in the interleaved manner, it becomes possible to absorbdifference in data transfer rate between the external host CPU and theinternal data bus and thereby to perform continuous (gapless) datatransfer.

In orthogonal transformation circuit 400, a flip-flop and a tri-statebuffer are used for forming the transformation element. As described inthe embodiments previously, however, the orthogonal transformationcircuit may be configured using a dual port memory, of which one port iscoupled to the host system bus and the other port of which is coupled tothe first internal transfer bus. When such a dual port memory is used,area efficiency can be improved, and chip area can be made smaller.

FIG. 126 schematically shows a construction of a cross-bar switch shownin FIG. 120. FIG. 126 shows a construction of the cross-bar switch for1-bit transfer bus lines SBS[y] and /SBS[y] among the second internaltransfer bus SBS[(m−1):0]. The construction of FIG. 126 is provided foreach bus line of the second internal transfer bus SBS.

Referring to FIG. 126, cross-bar switch 402 includes decoders DDD-0 toDDD(m−1) provided corresponding to the first internal transfer bus linesCBS[], /CBS[0] to CBS[m−1], /CBS[m−1] and selective switch circuits DSW0to DSW(m−1) connecting the first internal transfer bus lines CBS[0],/CBS[0] to CBS[m−1], /CBS[m−1] to the second internal transfer bus linesSBS[y], /SBS[y] in accordance with the output signals from decoders DDD0to DDD(m−1).

Decoders DDD0 to DDD(m−1) each include a decode circuit 440 decodingconnection control signals DEC[0] to DEC[4], and an AND circuit 441outputting a switch control signal to corresponding one of switchcircuits DSW0 to DSW(m−1) in accordance with a predecode signal outputby decode circuit 440.

Connection control signals DEC[0] to DEC[4] represent a connectioncontrol signal of 5-bits, assuming that the first internal transfer busCBS has 32 bits. The bit width of connection control signal DEC isdetermined in accordance with the bus width of the first internaltransfer bus CBS. One output signal from decoders DDD0 to DDD(m−1) isset to the selected state, the corresponding selective switch circuitDSW (any of DSW0 to DSW(m−1)) is rendered conductive, and the selectedfirst internal transfer bus lines CBS[z], /CBS[z] are connected to thesecond internal transfer bus lines SBS[y], /SBS[y].

Connection of each of the bus lines of the second internal transfer busSBS is set based on the decoding operation, and therefore, selectiveconnection can be established, with the bus width of the first internaltransfer bus matched to that of the second internal transfer bus.

FIG. 127 schematically shows a configuration of the portion generatingthe connection control signals DEC[0] to DEC[4] shown in FIG. 126.Referring to FIG. 127, the connection control signal generating circuitincludes: register circuits XG00 to XG34 arranged in a matrix of rowsand columns; a sense amplifier circuit SAC amplifying the signals on thesecond internal transfer bus lines SBS[y] and /SBS[y] to generate asingle end signal; selection gates SSG0 to SSG4 provided correspondingto those of the register circuits XG00 to XG34 which are aligned in theY direction respectively, selectively rendered conductive in accordancewith selection signals SCb[0] to SCb[4] and transmitting, when renderedconductive, the output signal of sense amplifier circuit SAC; anddrivers DRV0 to DRV4 provided corresponding to respective columns ofregister circuits XG00 to XG34, amplifying output signals of thecorresponding registers and generating connection control signals DEC[0]to DEC[4], respectively.

Among register circuits XG00 to XG34, to those register circuits alignedin the X direction, input control signals SCi[0] to SCi[3] and outputcontrol signals SCc[0] and SCc[3] are commonly applied, respectively.

Each of the register circuits XG00 to XG34 includes: a transfer gate 452transferring data from corresponding selection gate SSG (any of SSG0 toSSG4) in accordance with the corresponding input control signal SCi[z];a latch circuit 453 latching the data applied through transfer gate 452;and a transfer gate 454 transferring the data latched in thecorresponding latch circuit 453 to the corresponding driver DRV (DRV0 toDRV4) in accordance with output control signal SCc[z]. Latch circuit 453includes a latch formed by inverters and latches the received signal.

Sense amplifier circuit SAC is activated in accordance with a senseamplifier activating signal SCs, and amplifies the data bits transferredfrom the basic operation block to the second internal transfer bus linesSBS[y] and /SBS[y].

In the configuration of the connection control signal generating portionshown in FIG. 127, 1-bit context information generated by senseamplifier circuit SAS is transferred to and latched by the registercircuits selected by selection gates SSG0 to SSG4 and input controlsignal SCi[0] to SCi[3]. In register circuits XGa0 to XGa4 aligned inthe X direction, one-bit context information determining the manner ofconnection of the cross bar switch is stored. Therefore, by transferringinformation of 5 bits serially from the basic operation block tointernal transfer bus lines SBS[y] and /SBS[y], and by setting selectionsignals SCb[0] to SCb[4] in synchronization with the data transfer, thecontext information bits are transferred through selection gates SSG0 toSSG4. In this operation, by maintaining one input control signal SCi atthe selected state, the context information bit transferred to theregister circuits aligned in the X direction is latched sequentially.Thus, by the register circuits aligned in the X-direction, contextinformation determining the manner of connection of one cross bar switchis stored.

Therefore, each of the input control signals SCi[0] to SCi[3] can selectthe context information, and hence, 4 ways of context information (4planes of context information) can be stored. The context informationfor determining a required manner of connection is read by setting anyof the output control signals SCc[0] to SCc[3] to the active state andtransmitted through drivers DRV0 to DRV4. Consequently, by the decodersDDD0-DDD(a−1) shown in FIG. 126, one of 32 pairs of internal transferbus lines CBS[0], /CBS[0] to CBS[m−1], /CBS[m−1] is selected.

By storing four pieces of information to determine the manner ofconnection of the cross bar switch, it becomes possible to switch themanner of connection of the cross bar switch on real time basis, and theorder of data arrangement can readily be changed at the time of transferto perform arithmetic operation. By way of example, when the internaltransfer bus CBS is of 8 bits and the second internal transfer bus SBSis of 32 bits, data can be transferred with the bus width adjusted, bysuccessively switching transfer paths for transferring 8 bits of data inthe cross bar switch, using the 4 planes of context information.

FIG. 128 schematically shows the overall configuration of cross barswitch 402. Referring to FIG. 128, cross bar switch 402 includes: aswitch matrix 464 including rows of switches 460 a arrangedcorresponding to the second internal transfer bus lines SBS[0] toSBS[k−1], respectively; a route determining circuit 462 includingdecoder groups 462 a arranged corresponding to the rows of switches 464a, respectively, for setting the connection path of switch matrix 464;and a route information storing circuit 460 including contextinformation storing portions 460 a arranged corresponding to the decodergroups 462 a, respectively, and storing information for determining theconnection route of route determining circuit 462.

The switch row 464 a includes selection switch circuits DSW0 to DSW(m−1)shown in FIG. 126, and connects any of the first internal transfer buslines CBS[0] to CBS[m−1] to the corresponding one of second internaltransfer bus lines SBS[0] to SBS[k−1].

Decoder group 462 a includes decoders DDD0 to DDD(j−1) shown in FIG.126, and sets conduction/non-conduction of the selection switches in thecorresponding switch row 464 a.

Context information storing circuit 460 a has such a structure as shownin FIG. 127, stores four kinds of context information for thecorresponding decoder group 462 a, and outputs any of the stored contextinformation to the corresponding decoder group 462 a in accordance withthe output control signal SCc.

To route information storing circuit 460, k bits of path designatinginformation is applied from sense amplifier circuit group 466. Senseamplifier circuit group 466 includes sense amplifier circuits shown inFIG. 127 in correspondence to the second internal transfer bus linesSBS[0] to SBS[k−1], respectively, and when activated, amplifies k-bitsof data applied from the basic operation block and transfers to thecorresponding context information storing circuit 460 a.

To the second internal transfer bus lines SBS[0] to SBS[k−1],information of the route information storing memory 460 of the basicoperation block FBi is read and transferred, under the control ofinternal controller 21. Controller 21 operates under the control ofcontrol CPU 25 included in central control unit 15, and successivelyoutputs connection information stored in the memory 460. Control CPU 25further outputs control signals SCb, SCc and SCi for path informationstoring circuit 460. When selection control signal SCb is toggled fivetimes, the signals SCb[4:0] are each selected once, and thus, storage ofone piece of context information is finished.

As route information storing memory 460, a specific area of the memorycell mat in the main processing circuitry may be used, or a dedicatedmemory may be provided separately from the memory cell mat.

Control CPU 25 further generates a sense activating signal (SCs) for thesense amplifier circuits (SAC) included in sense amplifier circuit group466 (of which path is not shown).

FIG. 129 schematically shows correspondence between the decoder/switchcircuit (hereinafter referred to as a unit connection circuit) ofdecoder group 462 a shown in FIG. 128 and the decode signals. Referringto FIG. 129, unit connection circuit UCBW0 connects the first transferbus line CBS[i] to the second transfer bus line SBS[i], when theconnection control signal DEC is 0 (in decimal notation). The unitconnection circuit UCBWx connects the first internal transfer bus lineCBS[(i+x)mod.m] to the second internal transfer bus line SBS[i], whenthe connection control signal DEC is (0+x) (in decimal notation).

The first internal transfer bus CBS has the bit width of m bits, andwhen the connection control signal DEC is “0”, the first internaltransfer bus line CBS[i] is always connected to the second internaltransfer bus line SBS[i]. Therefore, even when the connection path is tobe switched in cyclic manner, by the result value of operation “modulom” of connection control signal DEC, the connection of the firstinternal transfer bus can easily be determined, and when the decodesignal DEC is “0” in each decoder group 462 a, transfer bus lines CBS[j]and SBS[j] of the same number can be connected, and hence, programmingrelated to connection information is facilitated.

FIG. 130 schematically shows the construction of selector 404 shown inFIG. 120. FIG. 130 shows a construction of the selector for secondinternal transfer bus lines SBS[z] and /SBS[z]. In the constructionshown in FIG. 130, global data bus GBS has the bit width four times thatof the second internal transfer bus.

Selector 404 includes: a connection gate TGW0 connecting global data buslines GBS[4 z] and /GBS[4 z] to transfer bus lines SBS[z] and /SBS[z] inaccordance with a selection signal SS[0]; a connection gate TGW1connecting global data bus lines GBS[4 z+1] and /GBS[4 z+1] to transferbus lines SBS[z] and /SBS[z] in accordance with a selection signalSS[1]; a connection gate TGW2 connecting global data bus lines GBS[4z+2] and /GBS[4 z+2] to transfer bus lines SBS[z] and /SBS[z] inaccordance with a selection signal SS[2]; and a connection gate TGW3connecting global data bus lines GBS[4 z+3] and /GBS[4 z+3] to transferbus lines SBS[z] and /SBS[z] in accordance with a selection signalSS[3].

The global data bus lines GBS[4 z], /GBS[4 z] to GBS[4 z+3], /GBS[4 z+3]may not be the successively adjacent data bus lines, but may be buslines apart by m bits.

Selection signals SS[0] to SS[3] are generated by control CPU 25included in central control unit 15, and activated successively in datatransfer.

FIG. 131 schematically depicts the selecting operation by selector 404shown in FIG. 130. On the second internal transfer bus SBS, m-bit dataD0 to D3 are successively transferred. Selector 404 performs a ¼selection, and in the present embodiment, m-bit bus lines of global databus GBS are successively selected in accordance with the selectionsignals SS[3:0]. Consequently, m-bit data D0, D1, D2 and D3 fromselector 404 are distributed to data bus lines of global data bus GBS.

In the global data bus GBS, according to the method of selection shownin FIG. 131, data D0 to D3 consist of bits of mutually different datawords, and data D0 to D3 are stored in entries different from eachother.

When data D0 to D3 each consist of different data bits of the same setof words from others, or these data include different bits of a set ofdata words AA to DD, respectively, and it is necessary to write the dataD0 to D3 as such to the common entry of the memory cell mat in the mainprocessing circuitry successively, the connection path of selector 404is fixed, and, by way of example, the data D0 to D3 are successivelyoutput to specific m-bit data lines of global data bus GBS. This isshown in FIG. 132.

Referring to FIG. 132, data D0 to D3 are to be successively transferredto global data bus GBS[4 z]. Here, 4 z covers 0 to (m−1), and the globaldata bus GBS[4 z] is formed by neighboring data bus lines. In thismanner, data bits of the same word can be transferred through the sameglobal data bus lines successively, and hence, can be successivelystored in the common entry of the memory cell mat in the main processingcircuitry. Selector 404 is a bi-directional switch circuit, and whendata are transferred from global data bus GBS to the second internaltransfer bus SBS, data are transferred in accordance with the datatransfer sequence of FIG. 131 or FIG. 132.

In data distribution shown in FIG. 132 also, data D0 to D3 are arrangedin neighboring bus lines GBS[(j−1):0] of m bits of the global data busGBS. The data, however, may be arranged dispersed on bus lines apartfrom each other by m bits, that is, GBS[4 z|z=0(m−1)], namely, GBS[0],GBS[4] . . . , not on the neighboring bus lines.

According to the data bus connection control described above, as long asthe condition that each bit of a word is stored in the same entry of thememory cell mat of main processing circuitry is satisfied and thecondition that data arrangement is transformed by the input/outputcircuit is satisfied, the data distribution path can arbitrarily bedetermined.

As described above, according to Embodiment 20 of the present invention,between the system bus connected to an external CPU and a global databus to which internal basic operation blocks are connected, aninput/output circuit that performs data re-arrangement and bit widthadjustment is provided. Therefore, words can be transferred inbit-serial manner reliably to the entries of the main processingcircuitry of each basic operation block, regardless of the bit width ofdata words processed by the host CPU.

Embodiment 21

FIG. 133 is a circuit block diagram showing a construction of asemiconductor integrated circuit device according to Embodiment 21 ofthe present invention. Referring to FIG. 133, the semiconductorintegrated circuit device includes a plurality of (four in this example)functional blocks FBA1 to FBA4, four functional blocks FBB1 to FBB4, anda cross bar switch. These functional blocks FBA1 to FBA4 and FBB1 toFBB4 may correspond to the main control circuitries as describedhitherto in the preceding Embodiments, or may be assigned predeterminedprocessing operations. In the present embodiment and subsequentembodiments, the functional blocks are each merely required to beconfigured to perform a logic or arithmetic operation.

Functional blocks FBA1 to FBA4 are arranged along the X direction in thefigure, functional blocks FBB1 to FBB4 are arranged along the Xdirection in the figure and functional blocks FBB1 to FBB4 are arrangedopposite to functional blocks FBA1 to FBA4, respectively.

The cross bar switch is arranged between functional blocks FBA1 to FBA4and functional blocks FBB1 to FBB4, and connects functional blocks FBA1to FBA4 and functional blocks FBB1 to FBB4 in one-to-one relationshipbut in arbitrary combination. There are 4! possible combinations ofconnection.

Specifically, the cross bar switch includes select signal line pairsLLP1 to LLP8, data signal lines LL1 to LL8, decode circuits 501 to 516,and wired OR switches 521 to 536. Each of the data signal lines LL5 toLL8 extend in the X direction of the figure, along functional blocksFBB1 to FBB4. Each of the data signal lines LL1 to LL4 extend in the Ydirection of the figure orthogonal to the X direction. Data signal linesLL1 to LL4 are connected at first ends to data signal terminals offunctional blocks FBA1 to FBA4, respectively, and connected at secondends to data signal lines LL5 to LL8 through via holes.

Wired OR switches 521 to 524; 525 to 528; 529 to 532; 533 to 536 arearranged corresponding to the data signal lines LL5 to LL8,respectively. Wired OR switches 521 to 524 are connected to thecorresponding data signal line LL5 and data signal terminals offunctional blocks FBB1 to FBB4, respectively, and controlled by outputsignals of decode circuits 501 to 504, respectively. Wired OR switches525 to 528 are connected to the corresponding data signal line LL6 anddata signal terminals of functional blocks FBB1 to FBB4, respectively,and controlled by output signals of decode circuits 505 to 508,respectively.

Wired OR switches 529 to 532 are connected to the corresponding datasignal line LL7 and data signal terminals of functional blocks FBB1 toFBB4, respectively, and controlled by output signals of decode circuits509 to 512, respectively. Wired OR switches 533 to 536 are connected tothe corresponding data signal line LL8 and data signal terminals offunctional blocks FBB1 to FBB4, respectively, and controlled by outputsignals of decode circuits 513 to 516, respectively.

Each of the select signal line pairs LLP1 to LLP4 extends in the Ydirection of the figure. Select signal line pairs LLP1 to LLP4 areconnected at first ends to select signal terminal pairs of functionalblocks FBA1 to FBA4, and connected at second ends to decode circuits501, 506, 511 and 516, respectively.

Each of the select signal line pairs LLP5 to LLP8 extend in the Xdirection of the figure, along functional blocks FBB1 to FBB4. Selectsignal pair LLP5 is connected to select signal pair LLP1 through a viahole, and transmits the select signal from functional block FBA1 to eachof decode circuits 502, 503, and 504. Select signal pair LLP6 isconnected to select signal pair LLP2 through a via hole, and transmitsthe select signal from functional block FBA2 to each of decode circuits505, 507, and 508. Select signal pair LLP7 is connected to select signalpair LLP3 through a via hole, and transmits the select signal fromfunctional block FBA3 to each of decode circuits 509, 510, and 512.Select signal pair LLP8 is connected to select signal pair LLP4 througha via hole, and transmits the select signal from functional block FBA4to each of decode circuits 513, 514, and 515.

When a select signal is output from each of functional blocks FBA1 toFBA4, one of the output signals from decode circuits 501 to 504, one ofthe output signals from decode circuits 505 to 508, one of the outputsignals from decode circuits 509 to 512, and one of the output signalsfrom decode circuits 513 to 516 are set to the active “H” level.

Consequently, one of wired OR switches 521 to 524, (by way of example,switch 522), one of wired OR switches 525 to 528, (by way of example,switch 528), one of wired OR switches 529 to 532, (by way of example,switch 529), and one of wired OR switches 533 to 536, (by way ofexample, switch 535) are rendered conductive. In this manner, functionalblocks FBA1 to FBA4 are connected in one-to-one correspondence and in anoptional combination to functional blocks FBB1 to FBB4.

FIG. 134 is a circuit block diagram more specifically showing theconstruction of the cross bar switch. Referring to FIG. 134, wired ORswitches 521 to 524 include N-channel MOS transistors (switchingelements) 521 a to 524 a, respectively. N-channel MOS transistors 521 ato 524 a have the first electrodes (source or drain) connected togetherto corresponding data signal line LLS, and the second electrodes (drainor source) connected to data signal terminals of functional blocks FBB1to FBB4, respectively, and receive, at their gates, output signals fromdecode circuits 501 to 504, respectively. N-channel MOS transistors 521a to 524 a are rendered conductive when the output signals of decodecircuits 501 to 504 are set to the “H” level, respectively. Other wiredOR switches 525 to 528, 529 to 532 and 533 to 536 are similar inconstruction to wired OR switches 521 to 524.

Each of the select signal line pairs LLP1 to LLP8 includes two signallines. The select signal is comprised of a data signal of 2 bits. Toeach of the decode circuits 501 to 504, unique select signal is allottedbeforehand. By way of example, select signals (00), (01), (10) and (11)are allotted to decode circuits 501 to 504, respectively. Decode circuit501 produces an output of “H” level when the select signal is “00”, thatis, when the signals of 2 bits included in the select signal are both atthe “L” level, and otherwise produces an output of “L” level.

Decode circuit 502 produces an output of “H” level when the selectsignal is “01”, that is, when 2-bit signals included in the selectsignal attain the “L” level and “H” level, and otherwise produces anoutput of “L” level. Decode circuit 503 produces an output of “H” levelwhen the select signal is “10”, that is, when 2-bit signals included inthe select signal attain the “H” level and “L” level, and otherwiseproduces an output of “L” level. Decode circuit 504 produces an outputof “H” level when the select signal is “11”, that is, when 2-bit signalsincluded in the select signal are both at the “H” level, and otherwiseproduces an output of “L” level. Other decode circuits 505 to 508; 509to 512; and 513 to 516 operate in the same manner as decode circuits 501to 504.

When the select signal is output from functional block FBA1, one ofdecode circuits 501 to 504 (for example, decode circuit 501) outputs the“H” level signal, and N-channel MOS transistor 521 a corresponding tothe selected decode circuit 501 is rendered conductive, so that the datasignal terminal of functional block FBA1 is connected to the data signalterminal of functional block FBB1.

Now, the effect of Embodiment 21 will be described. In the cross barswitch, the lines in the Y direction are data signal lines LL1 to LL4and select signal line pairs LLP1 to LLP4, and accordingly includes 12lines in total, while the lines in the X direction are data signal linesLL5 to LL8 and select signal line pairs LLP5 to LLP8, and accordinglyincludes 12 lines in total. There are 16 switches 521 to 536, and 16decode circuits 501 to 516.

Assume that a cross bar switch, of the same scheme as the cross barswitch of FIG. 133, is formed to connect N functional blocks FBA1 toFBAN to N functional blocks FBB1 to FBBN, with N=2̂m. Here, the symbol “̂”indicates the power and 2̂m indicates that 2 is multiplied m times. Inthat case, in the Y direction, there will be (m+1)×N lines, and in the Xdirection, there will be (m+1)×N lines, there will be N×N switches andN×N m-input decode circuits.

By way of example, when N=128 (m=7) and a switch is to be provided atevery intersection of signal lines as in a conventional simple switchmatrix in which 128×128 lines from 128 functional blocks at first sideand 128×128 lines from 128 functional blocks at the opposing side arecoupled to 128 lines extending in X direction through switch circuits,there are 3×128×128=49152 lines in the Y direction including the linesfor switch control, 128 lines in the X direction, and 32768 (=2×128×128)switches for connection to the first side functional blocks and theswitches for connection to the opposing side functional blocks. In thepresent invention, there are 8×128=1024 lines in the Y direction,8×128=1024 lines in the X direction, 16384 (=128×128) switches and 16384decoders. Therefore, the number of lines is even smaller in the presentinvention. Further, in the conventional simple matrix structure asdescribed above, the interconnection in the Y direction is in a denselayout and switches between the lines in the Y direction and thefunctional blocks are in a dense arrangement. In contrast, according tothe present invention, the lines and switches are uniformly dispersedalong the X and Y directions. Thus, the layout area can be made evensmaller in the present invention.

Further, according to the present invention, when bi-directional datatransfer is to be performed between functional blocks FBA1 to FBA4 andFBB1 to FBB4, basically, the same structure as shown in FIG. 133 can beused. Specifically, what is necessary is simply to issue select signalsincluding connection destination information from functional blocks FBB1to FBB4. Therefore, when bi-directional data transfer is desired, thedifference in layout area between the present invention and theconventional simple switch matrix becomes more significant.

Next, the application of the present invention will be described. Eachof the functional blocks FBA1 to FBA4 and FBB1 to FBB4 shown in FIG. 133is formed by a unit cell of ALU (Arithmetic and Logic Unit). The ALUunit cells include various operation unit cells. By coupling a pluralityof basic operation unit cells (Add, Mul, Div, Sub, Shift and others) inan organic manner, a functional element can be formed. As shown in FIG.133, by arranging a plurality of ALU unit cells at upper and lowerportions and programming the operation (connection routes) of the crossbar switch, the functional element can be formed. In this case, whensuch coupling is made bi-directional, a larger functional element can beimplemented. Further, by programming the cross bar switch, that is, byre-configuring P & R (Place and router), a reconfigurable logic can beachieved.

Embodiment 22

FIG. 135 is a circuit block diagram showing a main portion of asemiconductor integrated circuit device according to Embodiment 22 ofthe present invention, comparable to FIG. 134. Referring to FIG. 135,the semiconductor integrated circuit device differs from the device ofEmbodiment 21 in that latch circuits 537 are added to output nodes ofdecode circuits 501 to 516, respectively. For example, latch circuit 537corresponding to decode circuit 501 latches the output signal ofcorresponding decode circuit 501 in response to a latch signal φL, andapplies the latched signal to the gate of N-channel MOS transistor 521 aincluded in the corresponding wired OR switch 521.

In Embodiment 22, after the output signals of decode circuits 501 to 516are latched by latch circuit group 537, select signal line pairs LLP1 toLLP8 may be released for other use.

Embodiment 23

FIG. 136 is a block diagram showing a construction of a semiconductorintegrated circuit device according to Embodiment 23 of the presentinvention. Referring to FIG. 136, the shown semiconductor integratedcircuit device differs from the device of FIG. 133 in that decodecircuits 501 to 516 are replaced by a decode circuit portion DD and thatredundant functional block FRBA, redundant decode circuit portion RDD,redundant wired OR switch portion RSS and redundant functional blockFRBB are added. Wired OR switch portion SS includes wired OR switches521 to 536 shown in FIG. 133.

Decode circuit portion DD includes, in addition to decode circuits 501to 516 shown in FIG. 133, a program circuit for storing a select signaldesignating a defective functional block among functional blocks FBB1 toFBB4. When functional block FBB4 is defective, for example, a selectsignal designating functional block FBB4 is stored in the programcircuit of decode circuit portion DD.

When a select signal designating a normal functional block FBB2 isapplied from functional flock FBA1, decode circuit portion DD and wiredOR switch portion SS operate in the similar manner as decode circuits501 to 516 and wired OR switches 521 to 536 shown in FIG. 133, toconnect functional block FBA1 to functional block FBB2.

When a select signal designating a defective functional block FBB4 isapplied from functional block FBA1, the portions of decode circuitportion DD and wired OR switch portion SS corresponding to the defectivefunctional block FBB4 are inactivated, and redundant decode circuitportion RDD and redundant wired OR switch portion RSS are activated.Redundant decode circuit portion RDD and redundant wired OR switchportion RSS connect functional block RBA1 to redundant functional blockFRBB. In this manner, the defective functional block FBB1 is replaced byredundant functional block FRBB. When bi-directional data transfer is tobe performed, a defective functional block among functional blocks FBA1to FBA4 is replaced by redundant functional block FRBA in the similarmanner.

In Embodiment 23, redundancy function is provided for the functionalblocks and the cross bar switch. Therefore, a random logic, whichusually cannot have any redundancy function, is provided with redundancyfunction, and production yield can be improved.

Embodiment 24

FIG. 137 is a block diagram showing a construction of a semiconductorintegrated circuit device according to Embodiment 24 of the presentinvention. Referring to FIG. 137, the semiconductor integrated circuitdevice includes a number of functional blocks FBA1 to FBAn (n is aninteger not smaller than 2), a number of functional blocks FBB1 to FBBnand a cross bar switch. The cross bar switch includes a global decodecircuit portion GDD, a local decode circuit portion LDD and a wired ORswitch portion SS.

Wired OR switch portion SS includes, as described with reference to FIG.133, n wired OR switches corresponding to the respective functionalblocks FBA1 to FBAn. The n wired OR switches arranged correspond tofunctional blocks FBB1 to FBBn, respectively.

The n wired OR switches are divided into B switch groups, each groupincluding A switches. Global decode circuit portion GD selects, inaccordance with a global select signal from each functional block FBA,any switch group, among B switch groups, corresponding to thatfunctional block FBA. Local decode circuit group LDD selects, inaccordance with a local select signal from each functional block FBA,any wired OR switch among A wired OR switches belonging to the switchgroup selected by the global decode circuit GDD and corresponding to thefunctional block FBA, and renders conductive the selected wired ORswitch.

When n=16, for example, wired OR switch portion SS includes 16 wired ORswitches for each of the functional blocks FBA1 to FBA16. Sixteen wiredOR switches correspond to functional blocks FBB1 to FBB16, respectively.

Sixteen wired OR switches are divided into four switch groups eachincluding four switches, and global decode circuit portion GDD includesfour global decode circuits 540 corresponding to the four switch groups,as shown in FIG. 138. Local decode circuit LDD includes 16 local decodecircuits 541 corresponding to 16 wired OR switches, respectively.

When the global select signals GGS1 and GGS2 are output from thecorresponding functional block FBA, an output signal of any one globaldecode circuit 540 among four global decode circuits 40 attains the “H”level, and four local decode circuits 541 corresponding to the globaldecode circuit 540 are activated. When local select signals LLS1 to LLS4are output from the corresponding functional block FBA, an output signalof any one local decode circuit 541 among the activated four localdecode circuits 541 attains the “H” level, and the wired OR switchcorresponding to this local decode circuit 541 is rendered conductive.In this manner, functional blocks FBA1 to FBA16 can be connected inone-to-one correspondence to functional blocks FBB1 to FBB16 in adesired combination.

In Embodiment 24, as the decode circuit portion is configured to have ahierarchical structure, the number of lines for the select signals canbe reduced, and therefore, the decode circuit portion can be madecompact.

Embodiment 25

FIG. 139 is a block diagram representing a construction of asemiconductor integrated circuit device according to Embodiment 25 ofthe present invention. Referring to FIG. 139, the semiconductorintegrated circuit device includes a plurality of (five in FIG. 139)functional blocks FBA1 to FBAS, five functional blocks FBB1 to FBB5, anda cross bar switch. Functional blocks FBA1 to FBAS are divided into aplurality of groups, and in the example of FIG. 139, functional blocksFBA1 to FBA3 belong to a first group and functional blocks FBA4 and FBASbelong to a second group. The decode circuit portion of cross bar switchis divided into a decode circuit portion DD1 corresponding to the firstgroup and a decode circuit portion DD2 corresponding to the secondgroup. The wired OR switch portion of the cross bar switch is dividedinto a wired OR switch portion SS1 corresponding to the first group anda wired OR switch portion SS2 corresponding to the second group.Functional blocks FBB1 to FBB5 are divided into functional blocks FBB1to FBB3 corresponding to the first group and functional blocks FBB4 andFBB5 corresponding to the second group.

In the semiconductor integrated circuit device of the presentembodiment, a power supply line PPL1 supplying a power supply voltageVCC1 to functional blocks FBA1 to FBA3, decode circuit portion DD1 andwired OR switch portion SS1 and functional blocks FBB1 to FBB3 isseparately provided from a power supply line PPL2 supplying a powersupply voltage VCC2 to functional blocks FBA4 and FBA5, decode circuitportion DD2, wired OR switch portion SS2 and functional blocks FBB4 andFBB5. Therefore, when functional blocks FBA1 to FBA3 and related portiononly are to be activated, supply of power supply voltage VCC2 to powersupply line PPL2 is stopped, whereby unnecessary power consumption canbe avoided, and power consumption can be reduced.

Further, in the present semiconductor integrated circuit device, twofunctional elements can be formed simultaneously. Therefore, by formingtwo functional elements having the same function, parallel operationbecomes possible, and high processing function can be achieved.

The present invention is generally applicable to a data processingsystem. Particularly, by applying the present invention to a system thatrequires processing of a large amount of data such as image or audio, ahigh speed processing system can be achieved.

As for the chip configuration, one main processing circuitry portion maybe formed by one chip (semiconductor chip), or one basic operation blockmay be formed by one chip (semiconductor chip). Alternatively, onesemiconductor processing device may be formed by one chip (semiconductorchip) as a system LSI.

Although the present invention has been described and illustrated indetail, it is clearly understood that the same is by way of illustrationand example only and is not to be taken by way of limitation, the spiritand scope of the present invention being limited only by the terms ofthe appended claims.

1-31. (canceled)
 32. A cross bar switch, provided between a plurality offirst functional blocks arranged in a line and a plurality of secondfunctional blocks arranged opposing to said plurality of firstfunctional blocks respectively, for connecting said plurality of firstfunctional blocks and said plurality of second functional blocks inone-to-one correspondence in an optional combination, comprising: firstdata signal lines provided corresponding to the first functional blocks,connected to a data signal terminal of a corresponding first functionalblock, and extending in the same direction as a direction of arrangementin a line of said plurality of first functional blocks; and a selectingcircuit provided corresponding to each first data signal line, selectinga second functional block among said plurality of second functionalblocks in accordance with a select signal from a corresponding firstfunctional block, and connecting a data signal terminal of such selectedsecond functional block to the corresponding first data signal line. 33.The cross bar switch according to claim 32, further comprising a seconddata signal line provided corresponding to each of the first functionalblocks, extending in a direction orthogonal to the direction ofarrangement in a line of said plurality of first functional blocks;wherein said first data signal lines are connected to the data signalterminals of corresponding first functional blocks through correspondingsecond data signal lines.
 34. The cross bar switch according to claim32, wherein said selecting circuit includes a plurality of switchingelements, provided corresponding to said plurality of second functionalblocks, each connected between the data signal terminal of acorresponding second functional block and a corresponding first datasignal line, and a plurality of decode circuits, provided correspondingto said plurality of switching elements, each rendering conductive acorresponding switching element in response to an application of apreallotted select signal.
 35. The cross bar switch according to claim34, wherein said selecting circuit further includes a first selectsignal line connected between a select signal terminal of thecorresponding first functional block and a decode circuit of saidplurality of decode circuits, extending in a direction orthogonal to thedirection of arrangement in a line of said plurality of first functionalblocks, and a second select signal line connected to said first selectsignal line, extending in the same direction as the direction ofarrangement in a line of said plurality of first functional blocks, andapplying said select signal to another decode circuit.
 36. The cross barswitch according to claim 34, wherein said selecting circuit furtherincludes a latch circuit provided corresponding to each decode circuit,latching an output signal of a corresponding decode circuit.
 37. Thecross bar switch according to claim 32, wherein said select signalincludes a global select signal and a local select signal; and saidselecting circuit includes a plurality of switching elements, providedcorresponding to said plurality of second functional blocks and dividedinto a plurality of groups, each being connected between the data signalterminal of a corresponding second functional block and a correspondingfirst data signal line, a plurality of global decode circuits, providedcorresponding to said plurality of groups, each outputting an activatingsignal in response to an application of a preallotted global selectsignal, and a plurality of local decode circuits, provided correspondingto respective groups and corresponding to the plurality of switchingelements of a corresponding group, each rendering conductive acorresponding switching element in response to an application of anactivating signal from a corresponding global decode circuit andapplication of a preallotted local select signal.
 38. The cross barswitch according to claim 32, wherein said selecting circuit furtherselects any of said plurality of second functional blocks in accordancewith a select signal from a second functional block opposing to acorresponding first functional block, and connects the data signalterminal of the selected second functional block to the correspondingfirst data signal line.
 39. The cross bar switch according to claim 32,further comprising: a redundant second functional block for replacing adefective second functional block among said plurality of secondfunctional blocks; wherein when said defective second functional blockis designated by the select signal from the corresponding firstfunctional block, said selecting circuit selects said redundant secondfunctional block in place of said defective second functional block, andconnects the data signal terminal of the selected redundant secondfunctional block to the corresponding first data signal line.
 40. Thecross bar switch according to claim 32, wherein a set of said pluralityof first functional blocks and said plurality of second functionalblocks is duplicated by a plurality of sets; said cross bar switchconnects said plurality of first functional blocks and said plurality ofsecond functional blocks in the one-to-one correspondence and in anoptional combination in each set; said first data signal lines and theselecting circuits are provided for each set, and a power supply voltagecan be selectively supplied and stopped for each set.